Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300668.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 HealthRecord-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 175K 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 HealthRecord-PT-17-LTLFireability-00
FORMULA_NAME HealthRecord-PT-17-LTLFireability-01
FORMULA_NAME HealthRecord-PT-17-LTLFireability-02
FORMULA_NAME HealthRecord-PT-17-LTLFireability-03
FORMULA_NAME HealthRecord-PT-17-LTLFireability-04
FORMULA_NAME HealthRecord-PT-17-LTLFireability-05
FORMULA_NAME HealthRecord-PT-17-LTLFireability-06
FORMULA_NAME HealthRecord-PT-17-LTLFireability-07
FORMULA_NAME HealthRecord-PT-17-LTLFireability-08
FORMULA_NAME HealthRecord-PT-17-LTLFireability-09
FORMULA_NAME HealthRecord-PT-17-LTLFireability-10
FORMULA_NAME HealthRecord-PT-17-LTLFireability-11
FORMULA_NAME HealthRecord-PT-17-LTLFireability-12
FORMULA_NAME HealthRecord-PT-17-LTLFireability-13
FORMULA_NAME HealthRecord-PT-17-LTLFireability-14
FORMULA_NAME HealthRecord-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749012638765

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 04:50:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 04:50:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 04:50:41] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2025-06-04 04:50:41] [INFO ] Transformed 624 places.
[2025-06-04 04:50:41] [INFO ] Transformed 828 transitions.
[2025-06-04 04:50:41] [INFO ] Found NUPN structural information;
[2025-06-04 04:50:41] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-17-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 500 transition count 682
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 500 transition count 682
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 301 place count 447 transition count 615
Iterating global reduction 0 with 53 rules applied. Total rules applied 354 place count 447 transition count 615
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 358 place count 447 transition count 611
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 383 place count 422 transition count 568
Iterating global reduction 1 with 25 rules applied. Total rules applied 408 place count 422 transition count 568
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 423 place count 407 transition count 543
Iterating global reduction 1 with 15 rules applied. Total rules applied 438 place count 407 transition count 543
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 445 place count 400 transition count 532
Iterating global reduction 1 with 7 rules applied. Total rules applied 452 place count 400 transition count 532
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 457 place count 395 transition count 522
Iterating global reduction 1 with 5 rules applied. Total rules applied 462 place count 395 transition count 522
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 467 place count 390 transition count 517
Iterating global reduction 1 with 5 rules applied. Total rules applied 472 place count 390 transition count 517
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 476 place count 386 transition count 513
Iterating global reduction 1 with 4 rules applied. Total rules applied 480 place count 386 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 482 place count 386 transition count 511
Applied a total of 482 rules in 433 ms. Remains 386 /624 variables (removed 238) and now considering 511/828 (removed 317) transitions.
// Phase 1: matrix 511 rows 386 cols
[2025-06-04 04:50:42] [INFO ] Computed 18 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:50:43] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-06-04 04:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:50:44] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2025-06-04 04:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/386 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:02] [INFO ] Deduced a trap composed of 34 places in 486 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:03] [INFO ] Deduced a trap composed of 141 places in 345 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:04] [INFO ] Deduced a trap composed of 113 places in 343 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:04] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:05] [INFO ] Deduced a trap composed of 43 places in 335 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:05] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:05] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:06] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:07] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:07] [INFO ] Deduced a trap composed of 53 places in 328 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:07] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:08] [INFO ] Deduced a trap composed of 47 places in 349 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:08] [INFO ] Deduced a trap composed of 47 places in 347 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:08] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:09] [INFO ] Deduced a trap composed of 119 places in 362 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:09] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:10] [INFO ] Deduced a trap composed of 54 places in 361 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:10] [INFO ] Deduced a trap composed of 54 places in 405 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:11] [INFO ] Deduced a trap composed of 46 places in 407 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:13] [INFO ] Deduced a trap composed of 60 places in 360 ms of which 47 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/897 variables, and 38 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/386 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/386 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:22] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:23] [INFO ] Deduced a trap composed of 65 places in 425 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:23] [INFO ] Deduced a trap composed of 142 places in 462 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:23] [INFO ] Deduced a trap composed of 67 places in 306 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:24] [INFO ] Deduced a trap composed of 67 places in 370 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:24] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:25] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:26] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:26] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:26] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:28] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:28] [INFO ] Deduced a trap composed of 72 places in 378 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:29] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:29] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:29] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:29] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:30] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:31] [INFO ] Deduced a trap composed of 71 places in 249 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:31] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:32] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:34] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:34] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:34] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:35] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:35] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:36] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:37] [INFO ] Deduced a trap composed of 63 places in 276 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:38] [INFO ] Deduced a trap composed of 57 places in 315 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:38] [INFO ] Deduced a trap composed of 62 places in 296 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:39] [INFO ] Deduced a trap composed of 65 places in 324 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:39] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:40] [INFO ] Deduced a trap composed of 58 places in 335 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:40] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:41] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:42] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:43] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:43] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:43] [INFO ] Deduced a trap composed of 75 places in 279 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:44] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/897 variables, and 77 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/386 constraints, PredecessorRefiner: 0/510 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in LTL mode, iteration 1 : 386/624 places, 511/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62485 ms. Remains : 386/624 places, 511/828 transitions.
Support contains 37 out of 386 places after structural reductions.
[2025-06-04 04:51:45] [INFO ] Flatten gal took : 128 ms
[2025-06-04 04:51:45] [INFO ] Flatten gal took : 63 ms
[2025-06-04 04:51:45] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 34 out of 386 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (351 resets) in 2300 ms. (17 steps per ms) remains 13/32 properties
BEST_FIRST walk for 40004 steps (56 resets) in 335 ms. (119 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (58 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (56 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (57 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (56 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (60 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (56 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (59 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (40 resets) in 122 ms. (325 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
[2025-06-04 04:51:46] [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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/122 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 264/386 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:47] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:47] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:48] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:48] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:48] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:48] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 511/897 variables, 386/410 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:49] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:49] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/897 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/897 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 412 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4148 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 386/386 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/122 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 264/386 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:51] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:51] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:52] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:52] [INFO ] Deduced a trap composed of 47 places in 364 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:53] [INFO ] Deduced a trap composed of 54 places in 373 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:53] [INFO ] Deduced a trap composed of 69 places in 298 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:53] [INFO ] Deduced a trap composed of 70 places in 272 ms of which 54 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:54] [INFO ] Deduced a trap composed of 48 places in 370 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:54] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:55] [INFO ] Deduced a trap composed of 66 places in 334 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:55] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:55] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:51:56] [INFO ] Deduced a trap composed of 42 places in 397 ms of which 69 ms to minimize.
SMT process timed out in 9218ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 425 edges and 386 vertex of which 62 / 386 are part of one of the 20 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 763 edges and 344 vertex of which 334 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 334 transition count 295
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 160 rules applied. Total rules applied 309 place count 187 transition count 282
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 318 place count 180 transition count 280
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 323 place count 178 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 177 transition count 277
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 324 place count 177 transition count 270
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 338 place count 170 transition count 270
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 349 place count 159 transition count 247
Iterating global reduction 5 with 11 rules applied. Total rules applied 360 place count 159 transition count 247
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 362 place count 159 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 364 place count 157 transition count 245
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 371 place count 150 transition count 236
Iterating global reduction 7 with 7 rules applied. Total rules applied 378 place count 150 transition count 236
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 382 place count 150 transition count 232
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 383 place count 149 transition count 230
Iterating global reduction 8 with 1 rules applied. Total rules applied 384 place count 149 transition count 230
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 385 place count 148 transition count 228
Iterating global reduction 8 with 1 rules applied. Total rules applied 386 place count 148 transition count 228
Performed 49 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 484 place count 99 transition count 175
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 492 place count 99 transition count 167
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 500 place count 91 transition count 151
Iterating global reduction 9 with 8 rules applied. Total rules applied 508 place count 91 transition count 151
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 510 place count 89 transition count 148
Iterating global reduction 9 with 2 rules applied. Total rules applied 512 place count 89 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 515 place count 89 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 517 place count 88 transition count 144
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 531 place count 81 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 540 place count 81 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 542 place count 80 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 564 place count 80 transition count 168
Free-agglomeration rule applied 19 times.
Iterating global reduction 11 with 19 rules applied. Total rules applied 583 place count 80 transition count 149
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 602 place count 61 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 604 place count 61 transition count 147
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 612 place count 61 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 613 place count 61 transition count 146
Applied a total of 613 rules in 243 ms. Remains 61 /386 variables (removed 325) and now considering 146/511 (removed 365) transitions.
Running 138 sub problems to find dead transitions.
[2025-06-04 04:51:56] [INFO ] Flow matrix only has 138 transitions (discarded 8 similar events)
// Phase 1: matrix 138 rows 61 cols
[2025-06-04 04:51:56] [INFO ] Computed 8 invariants in 4 ms
[2025-06-04 04:51:56] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD131 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 3 (OVERLAPS) 138/199 variables, 61/69 constraints. Problems are: Problem set: 2 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 18/87 constraints. Problems are: Problem set: 2 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:00] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 8 ms to minimize.
Problem TDEAD141 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 88 constraints, problems are : Problem set: 3 solved, 135 unsolved in 8442 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 3/61 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 138/199 variables, 61/70 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 18/88 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 135/223 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:08] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:08] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/225 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/226 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:13] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 227 constraints, problems are : Problem set: 3 solved, 135 unsolved in 17375 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25989ms problems are : Problem set: 3 solved, 135 unsolved
Search for dead transitions found 3 dead transitions in 25991ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/386 places, 143/511 transitions.
Graph (complete) has 246 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26243 ms. Remains : 59/386 places, 143/511 transitions.
RANDOM walk for 40000 steps (4978 resets) in 658 ms. (60 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (636 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (640 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (644 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (639 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (646 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
[2025-06-04 04:52:22] [INFO ] Flow matrix only has 135 transitions (discarded 8 similar events)
// Phase 1: matrix 135 rows 59 cols
[2025-06-04 04:52:22] [INFO ] Computed 7 invariants in 3 ms
[2025-06-04 04:52:22] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/36 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/136 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 51/187 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 7/194 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/194 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 84 constraints, problems are : Problem set: 0 solved, 5 unsolved in 444 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/36 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/136 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 51/187 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 7/194 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/194 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 89 constraints, problems are : Problem set: 0 solved, 5 unsolved in 519 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 894 steps, including 61 resets, run visited all 2 properties in 6 ms. (steps per millisecond=149 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 145 ms.
FORMULA HealthRecord-PT-17-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-17-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 115 stabilizing places and 127 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1&&(F(p2) U X(p3))))))'
Support contains 4 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 371 transition count 490
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 371 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 371 transition count 488
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 366 transition count 480
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 366 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 362 transition count 473
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 362 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 360 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 360 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 358 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 358 transition count 467
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 358 transition count 463
Applied a total of 62 rules in 105 ms. Remains 358 /386 variables (removed 28) and now considering 463/511 (removed 48) transitions.
// Phase 1: matrix 463 rows 358 cols
[2025-06-04 04:52:24] [INFO ] Computed 18 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:52:24] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-04 04:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:52:25] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-06-04 04:52: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/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:41] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:42] [INFO ] Deduced a trap composed of 134 places in 379 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:42] [INFO ] Deduced a trap composed of 107 places in 359 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:43] [INFO ] Deduced a trap composed of 85 places in 359 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:43] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:44] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:44] [INFO ] Deduced a trap composed of 31 places in 372 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:45] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:45] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:46] [INFO ] Deduced a trap composed of 70 places in 373 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:47] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:47] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:47] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:48] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:48] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:48] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:49] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:50] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:50] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:52:51] [INFO ] Deduced a trap composed of 70 places in 266 ms of which 45 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/821 variables, and 38 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:02] [INFO ] Deduced a trap composed of 135 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:02] [INFO ] Deduced a trap composed of 60 places in 292 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:03] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:03] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:03] [INFO ] Deduced a trap composed of 112 places in 349 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:04] [INFO ] Deduced a trap composed of 192 places in 310 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:05] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:08] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:08] [INFO ] Deduced a trap composed of 192 places in 282 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:09] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:11] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:12] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:14] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:17] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:18] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:19] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:19] [INFO ] Deduced a trap composed of 68 places in 288 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:20] [INFO ] Deduced a trap composed of 70 places in 271 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:20] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:24] [INFO ] Deduced a trap composed of 113 places in 350 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/821 variables, and 58 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 0/462 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 358/386 places, 463/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60988 ms. Remains : 358/386 places, 463/511 transitions.
Stuttering acceptance computed with spot in 1014 ms :[(OR (NOT p3) (NOT p1)), true, (AND p1 (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-00
Product exploration explored 100000 steps with 40087 reset in 586 ms.
Product exploration explored 100000 steps with 39920 reset in 440 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Detected a total of 111/358 stabilizing places and 119/463 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (AND p1 p3)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (AND p1 (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 43 factoid took 545 ms. Reduced automaton from 12 states, 41 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2)]
RANDOM walk for 40000 steps (348 resets) in 302 ms. (132 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (59 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
[2025-06-04 04:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 254/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 463/821 variables, 358/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/821 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 254/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 463/821 variables, 358/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/821 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1621ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 463/463 transitions.
Graph (trivial) has 403 edges and 358 vertex of which 58 / 358 are part of one of the 20 SCC in 2 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Graph (complete) has 693 edges and 320 vertex of which 310 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 310 transition count 253
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 159 rules applied. Total rules applied 307 place count 164 transition count 240
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 314 place count 157 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 314 place count 157 transition count 235
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 324 place count 152 transition count 235
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 142 transition count 216
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 142 transition count 216
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 349 place count 142 transition count 211
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 354 place count 137 transition count 211
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 362 place count 129 transition count 198
Iterating global reduction 5 with 8 rules applied. Total rules applied 370 place count 129 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 373 place count 129 transition count 195
Performed 50 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 473 place count 79 transition count 141
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 484 place count 79 transition count 130
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 492 place count 71 transition count 114
Iterating global reduction 7 with 8 rules applied. Total rules applied 500 place count 71 transition count 114
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 503 place count 68 transition count 109
Iterating global reduction 7 with 3 rules applied. Total rules applied 506 place count 68 transition count 109
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 508 place count 66 transition count 101
Iterating global reduction 7 with 2 rules applied. Total rules applied 510 place count 66 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 513 place count 66 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 521 place count 62 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 527 place count 62 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 529 place count 61 transition count 140
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 530 place count 60 transition count 137
Iterating global reduction 8 with 1 rules applied. Total rules applied 531 place count 60 transition count 137
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 534 place count 57 transition count 132
Iterating global reduction 8 with 3 rules applied. Total rules applied 537 place count 57 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 548 place count 57 transition count 121
Free-agglomeration rule applied 25 times with reduction of 5 identical transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 573 place count 57 transition count 91
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 598 place count 32 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 605 place count 32 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 606 place count 32 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 607 place count 31 transition count 83
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 610 place count 31 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 611 place count 31 transition count 83
Applied a total of 611 rules in 119 ms. Remains 31 /358 variables (removed 327) and now considering 83/463 (removed 380) transitions.
Running 75 sub problems to find dead transitions.
[2025-06-04 04:53:30] [INFO ] Flow matrix only has 69 transitions (discarded 14 similar events)
// Phase 1: matrix 69 rows 31 cols
[2025-06-04 04:53:30] [INFO ] Computed 8 invariants in 1 ms
[2025-06-04 04:53:30] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 3 (OVERLAPS) 69/100 variables, 31/39 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 26/65 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 65 constraints, problems are : Problem set: 4 solved, 71 unsolved in 2920 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 71 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 69/100 variables, 31/39 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 26/65 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 71/136 constraints. Problems are: Problem set: 4 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:36] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/137 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 137 constraints, problems are : Problem set: 4 solved, 71 unsolved in 6551 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 71/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9537ms problems are : Problem set: 4 solved, 71 unsolved
Search for dead transitions found 4 dead transitions in 9538ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/358 places, 79/463 transitions.
Graph (complete) has 115 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 79
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 30 transition count 79
Applied a total of 6 rules in 8 ms. Remains 30 /31 variables (removed 1) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9666 ms. Remains : 30/358 places, 79/463 transitions.
RANDOM walk for 40000 steps (5676 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1019 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 32557 steps (859 resets) in 104 ms. (310 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X p3), (X (AND p1 p3)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (AND p1 (NOT p2) p3)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR p2 p3))), (F (NOT p1)), (F (NOT p3)), (F p2)]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 43 factoid took 898 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-00 finished in 76882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 446 edges and 386 vertex of which 64 / 386 are part of one of the 21 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 342 transition count 315
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 162 rules applied. Total rules applied 308 place count 197 transition count 298
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 317 place count 188 transition count 298
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 317 place count 188 transition count 291
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 331 place count 181 transition count 291
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 357 place count 155 transition count 246
Iterating global reduction 3 with 26 rules applied. Total rules applied 383 place count 155 transition count 246
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 388 place count 155 transition count 241
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 393 place count 150 transition count 241
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 403 place count 140 transition count 226
Iterating global reduction 5 with 10 rules applied. Total rules applied 413 place count 140 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 417 place count 140 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 139 transition count 220
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 138 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 138 transition count 218
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 137 transition count 216
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 137 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 426 place count 137 transition count 213
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 524 place count 88 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 531 place count 88 transition count 154
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 540 place count 79 transition count 136
Iterating global reduction 8 with 9 rules applied. Total rules applied 549 place count 79 transition count 136
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 552 place count 76 transition count 132
Iterating global reduction 8 with 3 rules applied. Total rules applied 555 place count 76 transition count 132
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 75 transition count 128
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 75 transition count 128
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 563 place count 72 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 71 transition count 162
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 71 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 567 place count 70 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 568 place count 69 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 69 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 586 place count 69 transition count 153
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 587 place count 68 transition count 152
Iterating global reduction 8 with 1 rules applied. Total rules applied 588 place count 68 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 589 place count 68 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 591 place count 67 transition count 162
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 592 place count 66 transition count 159
Iterating global reduction 9 with 1 rules applied. Total rules applied 593 place count 66 transition count 159
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 596 place count 63 transition count 154
Iterating global reduction 9 with 3 rules applied. Total rules applied 599 place count 63 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 610 place count 63 transition count 143
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 611 place count 63 transition count 143
Applied a total of 611 rules in 100 ms. Remains 63 /386 variables (removed 323) and now considering 143/511 (removed 368) transitions.
[2025-06-04 04:53:41] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
// Phase 1: matrix 133 rows 63 cols
[2025-06-04 04:53:41] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:53:41] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-04 04:53:41] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
[2025-06-04 04:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:53:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-04 04:53:41] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:53:41] [INFO ] Redundant transitions in 41 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-04 04:53:41] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
[2025-06-04 04:53:41] [INFO ] Invariant cache hit.
[2025-06-04 04:53:41] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:42] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:43] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 132/195 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 97 constraints, problems are : Problem set: 0 solved, 135 unsolved in 9896 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:52] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:53:52] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 132/195 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 135/233 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 135 unsolved in 23871 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33876ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 33877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/386 places, 143/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34381 ms. Remains : 63/386 places, 143/511 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-01 finished in 34469 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((p0&&F(p1)))&&X(X(F(p0)))) U G(p2)))'
Support contains 3 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 372 transition count 492
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 372 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 372 transition count 490
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 367 transition count 482
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 367 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 363 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 363 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 361 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 361 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 359 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 359 transition count 469
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 359 transition count 465
Applied a total of 60 rules in 38 ms. Remains 359 /386 variables (removed 27) and now considering 465/511 (removed 46) transitions.
// Phase 1: matrix 465 rows 359 cols
[2025-06-04 04:54:15] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:54:16] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-04 04:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:54:16] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-04 04:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:33] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:33] [INFO ] Deduced a trap composed of 134 places in 355 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:34] [INFO ] Deduced a trap composed of 107 places in 356 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:34] [INFO ] Deduced a trap composed of 85 places in 354 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:35] [INFO ] Deduced a trap composed of 43 places in 361 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:35] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:36] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:36] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:37] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:38] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:38] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:39] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:39] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:40] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:40] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:41] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:41] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:42] [INFO ] Deduced a trap composed of 71 places in 231 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:42] [INFO ] Deduced a trap composed of 75 places in 305 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:42] [INFO ] Deduced a trap composed of 191 places in 271 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/824 variables, and 38 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:53] [INFO ] Deduced a trap composed of 135 places in 332 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:54] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:54] [INFO ] Deduced a trap composed of 60 places in 291 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:54] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:55] [INFO ] Deduced a trap composed of 112 places in 350 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:56] [INFO ] Deduced a trap composed of 113 places in 342 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:54:57] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:02] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:03] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:03] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:07] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:08] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:09] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:09] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:09] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:10] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:10] [INFO ] Deduced a trap composed of 70 places in 236 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:11] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:11] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:15] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:16] [INFO ] Deduced a trap composed of 69 places in 234 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/824 variables, and 59 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 0/464 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 359/386 places, 465/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60983 ms. Remains : 359/386 places, 465/511 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-02
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-02 finished in 61342 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(p0)||F((p1&&X(G(p2))))))'
Support contains 2 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 371 transition count 491
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 371 transition count 491
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 371 transition count 488
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 366 transition count 480
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 366 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 362 transition count 473
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 362 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 360 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 360 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 358 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 358 transition count 467
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 63 place count 358 transition count 463
Applied a total of 63 rules in 57 ms. Remains 358 /386 variables (removed 28) and now considering 463/511 (removed 48) transitions.
// Phase 1: matrix 463 rows 358 cols
[2025-06-04 04:55:17] [INFO ] Computed 18 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:55:17] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-04 04:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:55:18] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-06-04 04:55: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/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:34] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:34] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:35] [INFO ] Deduced a trap composed of 134 places in 351 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:35] [INFO ] Deduced a trap composed of 107 places in 347 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:36] [INFO ] Deduced a trap composed of 85 places in 347 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:36] [INFO ] Deduced a trap composed of 43 places in 350 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:37] [INFO ] Deduced a trap composed of 40 places in 322 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:37] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:38] [INFO ] Deduced a trap composed of 191 places in 293 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:38] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:39] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:39] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:40] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:40] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:40] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:41] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:41] [INFO ] Deduced a trap composed of 73 places in 237 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:42] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:42] [INFO ] Deduced a trap composed of 69 places in 234 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:43] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/821 variables, and 38 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:54] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:55] [INFO ] Deduced a trap composed of 135 places in 401 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:55] [INFO ] Deduced a trap composed of 60 places in 321 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:56] [INFO ] Deduced a trap composed of 61 places in 331 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:56] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:56] [INFO ] Deduced a trap composed of 112 places in 213 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:57] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:57] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:58] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:59] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:59] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:55:59] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:00] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:00] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:01] [INFO ] Deduced a trap composed of 84 places in 335 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:01] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:02] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:02] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:02] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:04] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 55 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:05] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:06] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:07] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:11] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:11] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:12] [INFO ] Deduced a trap composed of 53 places in 348 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:13] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:16] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:16] [INFO ] Deduced a trap composed of 59 places in 290 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:17] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:18] [INFO ] Deduced a trap composed of 58 places in 308 ms of which 35 ms to minimize.
SMT process timed out in 60287ms, After SMT, problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 358/386 places, 463/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61127 ms. Remains : 358/386 places, 463/511 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Detected a total of 111/358 stabilizing places and 119/463 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 28 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-03 finished in 62069 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' '!(((p0||G(p1)) U X(!p0)))'
Support contains 2 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 372 transition count 491
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 372 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 372 transition count 489
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 367 transition count 481
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 367 transition count 481
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 363 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 363 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 361 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 361 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 359 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 359 transition count 468
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 359 transition count 464
Applied a total of 60 rules in 62 ms. Remains 359 /386 variables (removed 27) and now considering 464/511 (removed 47) transitions.
// Phase 1: matrix 464 rows 359 cols
[2025-06-04 04:56:19] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:56:19] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-04 04:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:56:20] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-04 04:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:36] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:36] [INFO ] Deduced a trap composed of 134 places in 348 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:37] [INFO ] Deduced a trap composed of 107 places in 344 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:37] [INFO ] Deduced a trap composed of 85 places in 342 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:38] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:38] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:39] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:39] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:40] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:40] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:41] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:41] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:41] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:41] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:42] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:42] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:43] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:44] [INFO ] Deduced a trap composed of 71 places in 278 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:44] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:45] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/823 variables, and 38 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:57] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:57] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:57] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:57] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:58] [INFO ] Deduced a trap composed of 114 places in 363 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:59] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:56:59] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:05] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:07] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:08] [INFO ] Deduced a trap composed of 191 places in 426 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:09] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:10] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:11] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:12] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:12] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:13] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:16] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/823 variables, and 55 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 0/463 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 359/386 places, 464/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 359/386 places, 464/511 transitions.
Stuttering acceptance computed with spot in 281 ms :[p0, p0, (AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Detected a total of 111/359 stabilizing places and 119/464 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-04 finished in 61781 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((X((X(F(!(p0 U p1)))&&F(p2)))||F(p0))))'
Support contains 3 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 442 edges and 386 vertex of which 61 / 386 are part of one of the 21 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 345 transition count 320
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 161 rules applied. Total rules applied 306 place count 201 transition count 303
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 316 place count 192 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 191 transition count 302
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 317 place count 191 transition count 295
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 331 place count 184 transition count 295
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 356 place count 159 transition count 252
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 159 transition count 252
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 386 place count 159 transition count 247
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 391 place count 154 transition count 247
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 401 place count 144 transition count 232
Iterating global reduction 6 with 10 rules applied. Total rules applied 411 place count 144 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 415 place count 144 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 416 place count 143 transition count 226
Iterating global reduction 7 with 1 rules applied. Total rules applied 417 place count 143 transition count 226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 418 place count 142 transition count 224
Iterating global reduction 7 with 1 rules applied. Total rules applied 419 place count 142 transition count 224
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 420 place count 141 transition count 222
Iterating global reduction 7 with 1 rules applied. Total rules applied 421 place count 141 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 424 place count 141 transition count 219
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 522 place count 92 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 529 place count 92 transition count 160
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 538 place count 83 transition count 142
Iterating global reduction 9 with 9 rules applied. Total rules applied 547 place count 83 transition count 142
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 550 place count 80 transition count 138
Iterating global reduction 9 with 3 rules applied. Total rules applied 553 place count 80 transition count 138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 554 place count 79 transition count 134
Iterating global reduction 9 with 1 rules applied. Total rules applied 555 place count 79 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 563 place count 75 transition count 172
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 564 place count 74 transition count 170
Iterating global reduction 9 with 1 rules applied. Total rules applied 565 place count 74 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 567 place count 73 transition count 182
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 568 place count 72 transition count 178
Iterating global reduction 9 with 1 rules applied. Total rules applied 569 place count 72 transition count 178
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 570 place count 71 transition count 174
Iterating global reduction 9 with 1 rules applied. Total rules applied 571 place count 71 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 576 place count 71 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 593 place count 71 transition count 152
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 594 place count 70 transition count 151
Iterating global reduction 10 with 1 rules applied. Total rules applied 595 place count 70 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 596 place count 70 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 598 place count 69 transition count 161
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 599 place count 68 transition count 158
Iterating global reduction 11 with 1 rules applied. Total rules applied 600 place count 68 transition count 158
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 603 place count 65 transition count 153
Iterating global reduction 11 with 3 rules applied. Total rules applied 606 place count 65 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 616 place count 65 transition count 143
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 617 place count 65 transition count 143
Applied a total of 617 rules in 102 ms. Remains 65 /386 variables (removed 321) and now considering 143/511 (removed 368) transitions.
[2025-06-04 04:57:21] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
// Phase 1: matrix 133 rows 65 cols
[2025-06-04 04:57:21] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:57:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 04:57:21] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
[2025-06-04 04:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:57:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-04 04:57:21] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:57:21] [INFO ] Redundant transitions in 26 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-04 04:57:21] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
[2025-06-04 04:57:21] [INFO ] Invariant cache hit.
[2025-06-04 04:57:21] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:22] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:23] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 132/197 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 1/198 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 99 constraints, problems are : Problem set: 0 solved, 135 unsolved in 11612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:57:34] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 132/197 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 135/234 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 235 constraints, problems are : Problem set: 0 solved, 135 unsolved in 21441 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33090ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 33091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/386 places, 143/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33453 ms. Remains : 65/386 places, 143/511 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 26682 steps with 6657 reset in 154 ms.
FORMULA HealthRecord-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-05 finished in 33798 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((p0 U (G(p0)||(p0&&G(p1))))) U ((p2&&X((p0 U (G(p0)||(p0&&G(p1))))))||X(G(p0)))))'
Support contains 4 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 373 transition count 493
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 373 transition count 493
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 373 transition count 490
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 368 transition count 482
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 368 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 364 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 364 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 362 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 362 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 360 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 360 transition count 466
Applied a total of 58 rules in 35 ms. Remains 360 /386 variables (removed 26) and now considering 466/511 (removed 45) transitions.
// Phase 1: matrix 466 rows 360 cols
[2025-06-04 04:57:54] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:57:55] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-04 04:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:57:55] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-04 04:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:12] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:12] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:13] [INFO ] Deduced a trap composed of 192 places in 357 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:13] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:14] [INFO ] Deduced a trap composed of 46 places in 352 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:14] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:14] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:16] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:19] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:19] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:21] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:21] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:21] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 31 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:32] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:32] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:32] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:33] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:33] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:33] [INFO ] Deduced a trap composed of 60 places in 291 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:34] [INFO ] Deduced a trap composed of 47 places in 348 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:34] [INFO ] Deduced a trap composed of 53 places in 352 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:34] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:35] [INFO ] Deduced a trap composed of 52 places in 343 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:35] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:35] [INFO ] Deduced a trap composed of 86 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:36] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:37] [INFO ] Deduced a trap composed of 61 places in 331 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:39] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:40] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:40] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:41] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:46] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:46] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:47] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:47] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:48] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:48] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:49] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:49] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:50] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:51] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:55] [INFO ] Deduced a trap composed of 66 places in 341 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:55] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 49 ms to minimize.
SMT process timed out in 60281ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 360/386 places, 466/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61050 ms. Remains : 360/386 places, 466/511 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 876 reset in 252 ms.
Product exploration explored 100000 steps with 877 reset in 455 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p0 p1)), (X (AND (NOT p2) p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 217 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (345 resets) in 556 ms. (71 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (62 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (58 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (63 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (57 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
[2025-06-04 04:58:57] [INFO ] Invariant cache hit.
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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:57] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:58] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:58] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:58] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 5 ms to minimize.
Problem apf3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/107 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 253/360 variables, 8/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 466/826 variables, 360/382 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/826 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 382 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 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: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:58:59] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 253/360 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 466/826 variables, 360/383 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 6/389 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/826 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/826 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 389 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3809ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 915 ms.
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 466/466 transitions.
Graph (trivial) has 402 edges and 360 vertex of which 60 / 360 are part of one of the 21 SCC in 2 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 702 edges and 321 vertex of which 311 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 311 transition count 256
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 155 rules applied. Total rules applied 301 place count 167 transition count 245
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 309 place count 161 transition count 243
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 314 place count 159 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 158 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 315 place count 158 transition count 235
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 325 place count 153 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 333 place count 145 transition count 219
Iterating global reduction 5 with 8 rules applied. Total rules applied 341 place count 145 transition count 219
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 345 place count 145 transition count 215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 349 place count 141 transition count 215
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 356 place count 134 transition count 204
Iterating global reduction 7 with 7 rules applied. Total rules applied 363 place count 134 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 366 place count 134 transition count 201
Performed 53 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 472 place count 81 transition count 145
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 482 place count 81 transition count 135
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 490 place count 73 transition count 119
Iterating global reduction 9 with 8 rules applied. Total rules applied 498 place count 73 transition count 119
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 501 place count 70 transition count 114
Iterating global reduction 9 with 3 rules applied. Total rules applied 504 place count 70 transition count 114
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 506 place count 68 transition count 106
Iterating global reduction 9 with 2 rules applied. Total rules applied 508 place count 68 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 511 place count 68 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 521 place count 63 transition count 152
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 522 place count 62 transition count 150
Iterating global reduction 10 with 1 rules applied. Total rules applied 523 place count 62 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 544 place count 62 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 546 place count 61 transition count 140
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 547 place count 60 transition count 137
Iterating global reduction 10 with 1 rules applied. Total rules applied 548 place count 60 transition count 137
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 551 place count 57 transition count 132
Iterating global reduction 10 with 3 rules applied. Total rules applied 554 place count 57 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 565 place count 57 transition count 121
Free-agglomeration rule applied 25 times with reduction of 3 identical transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 590 place count 57 transition count 93
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 615 place count 32 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 623 place count 32 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 626 place count 32 transition count 85
Applied a total of 626 rules in 57 ms. Remains 32 /360 variables (removed 328) and now considering 85/466 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 32/360 places, 85/466 transitions.
RANDOM walk for 40000 steps (5927 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (976 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (981 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1024 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4850 steps, run visited all 3 properties in 38 ms. (steps per millisecond=127 )
Probabilistic random walk after 4850 steps, saw 1315 distinct states, run finished after 44 ms. (steps per millisecond=110 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p0 p1)), (X (AND (NOT p2) p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 437 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 466/466 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2025-06-04 04:59:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:59:03] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-04 04:59:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:59:04] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-04 04:59:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:20] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:21] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:21] [INFO ] Deduced a trap composed of 192 places in 336 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:22] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:22] [INFO ] Deduced a trap composed of 46 places in 359 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:23] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:23] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:25] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:27] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:27] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:29] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:29] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:29] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 31 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:41] [INFO ] Deduced a trap composed of 134 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:41] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:41] [INFO ] Deduced a trap composed of 135 places in 304 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:41] [INFO ] Deduced a trap composed of 135 places in 273 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:42] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:42] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:43] [INFO ] Deduced a trap composed of 47 places in 340 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:43] [INFO ] Deduced a trap composed of 53 places in 352 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:43] [INFO ] Deduced a trap composed of 51 places in 375 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:44] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:44] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:45] [INFO ] Deduced a trap composed of 86 places in 323 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:45] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:46] [INFO ] Deduced a trap composed of 61 places in 307 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:48] [INFO ] Deduced a trap composed of 58 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:49] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:50] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:50] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:55] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:56] [INFO ] Deduced a trap composed of 68 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:57] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:57] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:58] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:58] [INFO ] Deduced a trap composed of 70 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:59] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:59:59] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:00] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:00] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/826 variables, and 59 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 0/465 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Finished structural reductions in LTL mode , in 1 iterations and 60945 ms. Remains : 360/360 places, 466/466 transitions.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 195 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (349 resets) in 428 ms. (93 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (60 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (58 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (62 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (59 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
[2025-06-04 05:00:05] [INFO ] Invariant cache hit.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:05] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:05] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:05] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/107 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:05] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 253/360 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 466/826 variables, 360/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/826 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 382 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/107 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 253/360 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 466/826 variables, 360/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/826 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/826 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 387 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3229ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 571 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 466/466 transitions.
Graph (trivial) has 404 edges and 360 vertex of which 60 / 360 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 702 edges and 321 vertex of which 311 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 311 transition count 255
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 158 rules applied. Total rules applied 305 place count 166 transition count 242
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 313 place count 159 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 316 place count 158 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 157 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 317 place count 157 transition count 234
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 327 place count 152 transition count 234
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 336 place count 143 transition count 217
Iterating global reduction 5 with 9 rules applied. Total rules applied 345 place count 143 transition count 217
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 349 place count 143 transition count 213
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 353 place count 139 transition count 213
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 360 place count 132 transition count 202
Iterating global reduction 7 with 7 rules applied. Total rules applied 367 place count 132 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 370 place count 132 transition count 199
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 476 place count 79 transition count 142
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 486 place count 79 transition count 132
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 494 place count 71 transition count 116
Iterating global reduction 9 with 8 rules applied. Total rules applied 502 place count 71 transition count 116
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 505 place count 68 transition count 111
Iterating global reduction 9 with 3 rules applied. Total rules applied 508 place count 68 transition count 111
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 510 place count 66 transition count 103
Iterating global reduction 9 with 2 rules applied. Total rules applied 512 place count 66 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 515 place count 66 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 525 place count 61 transition count 149
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 526 place count 60 transition count 147
Iterating global reduction 10 with 1 rules applied. Total rules applied 527 place count 60 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 548 place count 60 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 550 place count 59 transition count 137
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 551 place count 58 transition count 134
Iterating global reduction 10 with 1 rules applied. Total rules applied 552 place count 58 transition count 134
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 555 place count 55 transition count 129
Iterating global reduction 10 with 3 rules applied. Total rules applied 558 place count 55 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 569 place count 55 transition count 118
Free-agglomeration rule applied 24 times with reduction of 3 identical transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 593 place count 55 transition count 91
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 617 place count 31 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 624 place count 31 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 625 place count 31 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 626 place count 30 transition count 83
Applied a total of 626 rules in 35 ms. Remains 30 /360 variables (removed 330) and now considering 83/466 (removed 383) transitions.
Running 75 sub problems to find dead transitions.
[2025-06-04 05:00:09] [INFO ] Flow matrix only has 70 transitions (discarded 13 similar events)
// Phase 1: matrix 70 rows 30 cols
[2025-06-04 05:00:09] [INFO ] Computed 8 invariants in 0 ms
[2025-06-04 05:00:09] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 70/100 variables, 30/38 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 26/64 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 64 constraints, problems are : Problem set: 1 solved, 74 unsolved in 2810 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 74 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 70/100 variables, 30/38 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 26/64 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 74/138 constraints. Problems are: Problem set: 1 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:13] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 139 constraints, problems are : Problem set: 1 solved, 74 unsolved in 5647 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8484ms problems are : Problem set: 1 solved, 74 unsolved
Search for dead transitions found 1 dead transitions in 8484ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/360 places, 82/466 transitions.
Graph (complete) has 128 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 80
Applied a total of 5 rules in 6 ms. Remains 29 /30 variables (removed 1) and now considering 80/82 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8526 ms. Remains : 29/360 places, 80/466 transitions.
RANDOM walk for 40000 steps (5839 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (963 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1007 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3040 steps, run visited all 2 properties in 25 ms. (steps per millisecond=121 )
Probabilistic random walk after 3040 steps, saw 870 distinct states, run finished after 25 ms. (steps per millisecond=121 ) properties seen :2
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 15 factoid took 491 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 872 reset in 221 ms.
Product exploration explored 100000 steps with 876 reset in 260 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 466/466 transitions.
Graph (trivial) has 402 edges and 360 vertex of which 60 / 360 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 321 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 143 place count 321 transition count 415
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 143 place count 321 transition count 415
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 321 transition count 415
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 244 place count 225 transition count 314
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 340 place count 225 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 343 place count 222 transition count 311
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 346 place count 222 transition count 311
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 349 place count 222 transition count 308
Performed 60 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 409 place count 222 transition count 334
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 418 place count 222 transition count 325
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 470 place count 170 transition count 257
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 52 rules applied. Total rules applied 522 place count 170 transition count 257
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 527 place count 165 transition count 250
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 532 place count 165 transition count 250
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 538 place count 159 transition count 232
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 544 place count 159 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 547 place count 159 transition count 229
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 563 place count 159 transition count 369
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 579 place count 143 transition count 323
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 595 place count 143 transition count 323
Deduced a syphon composed of 73 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 624 place count 143 transition count 294
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 630 place count 137 transition count 275
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 636 place count 137 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 637 place count 137 transition count 290
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 640 place count 134 transition count 283
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 643 place count 134 transition count 283
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 646 place count 131 transition count 278
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 649 place count 131 transition count 278
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 650 place count 130 transition count 277
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 651 place count 130 transition count 277
Deduced a syphon composed of 65 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 654 place count 130 transition count 274
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 654 rules in 121 ms. Remains 130 /360 variables (removed 230) and now considering 274/466 (removed 192) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:00:20] [INFO ] Redundant transitions in 59 ms returned []
Running 266 sub problems to find dead transitions.
[2025-06-04 05:00:20] [INFO ] Flow matrix only has 259 transitions (discarded 15 similar events)
// Phase 1: matrix 259 rows 130 cols
[2025-06-04 05:00:20] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 05:00:20] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:23] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 5 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 4 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:24] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 10/19 constraints. Problems are: Problem set: 93 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 93 solved, 173 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 258/388 variables, 130/149 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/169 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/169 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/170 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/170 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/170 constraints. Problems are: Problem set: 117 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 170 constraints, problems are : Problem set: 117 solved, 149 unsolved in 19482 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 130/130 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 117 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 66/130 variables, 9/9 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 10/19 constraints. Problems are: Problem set: 117 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:40] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/20 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/20 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 258/388 variables, 130/150 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 20/170 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 149/319 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/319 constraints. Problems are: Problem set: 117 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 1/389 variables, 1/320 constraints. Problems are: Problem set: 117 solved, 149 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 320 constraints, problems are : Problem set: 117 solved, 149 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 130/130 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 149/266 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49601ms problems are : Problem set: 117 solved, 149 unsolved
Search for dead transitions found 117 dead transitions in 49602ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 130/360 places, 157/466 transitions.
Graph (complete) has 292 edges and 130 vertex of which 65 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 65 /130 variables (removed 65) and now considering 157/157 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/360 places, 157/466 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49799 ms. Remains : 65/360 places, 157/466 transitions.
Built C files in :
/tmp/ltsmin4285154058308350553
[2025-06-04 05:01:09] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4285154058308350553
Running compilation step : cd /tmp/ltsmin4285154058308350553;'/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 1454 ms.
Running link step : cd /tmp/ltsmin4285154058308350553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin4285154058308350553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2114452165782893137.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 466/466 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 466/466 (removed 0) transitions.
// Phase 1: matrix 466 rows 360 cols
[2025-06-04 05:01:24] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:01:25] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-04 05:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:01:25] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-04 05:01: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/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:39] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:40] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:40] [INFO ] Deduced a trap composed of 192 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:41] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:41] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:41] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:41] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:43] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:44] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:45] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:46] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:47] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:47] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:53] [INFO ] Deduced a trap composed of 134 places in 361 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:53] [INFO ] Deduced a trap composed of 107 places in 370 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:54] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:54] [INFO ] Deduced a trap composed of 70 places in 317 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:55] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:55] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 40 ms to minimize.
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 30149ms
Finished structural reductions in LTL mode , in 1 iterations and 30847 ms. Remains : 360/360 places, 466/466 transitions.
Built C files in :
/tmp/ltsmin18230583938988552832
[2025-06-04 05:01:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18230583938988552832
Running compilation step : cd /tmp/ltsmin18230583938988552832;'/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 1092 ms.
Running link step : cd /tmp/ltsmin18230583938988552832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18230583938988552832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1468779620321421837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 05:02:11] [INFO ] Flatten gal took : 27 ms
[2025-06-04 05:02:11] [INFO ] Flatten gal took : 26 ms
[2025-06-04 05:02:11] [INFO ] Time to serialize gal into /tmp/LTL13550120575710138851.gal : 8 ms
[2025-06-04 05:02:11] [INFO ] Time to serialize properties into /tmp/LTL2619418241195488541.prop : 1 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/LTL13550120575710138851.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6853135435748763336.hoa' '-atoms' '/tmp/LTL2619418241195488541.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/LTL2619418241195488541.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6853135435748763336.hoa
Detected timeout of ITS tools.
[2025-06-04 05:02:26] [INFO ] Flatten gal took : 25 ms
[2025-06-04 05:02:26] [INFO ] Flatten gal took : 22 ms
[2025-06-04 05:02:26] [INFO ] Time to serialize gal into /tmp/LTL5549532682860532689.gal : 6 ms
[2025-06-04 05:02:26] [INFO ] Time to serialize properties into /tmp/LTL3296472408647124227.ltl : 10 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/LTL5549532682860532689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3296472408647124227.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...275
Read 1 LTL properties
Checking formula 0 : !(((X(("(p349!=1)")U((G("(p349!=1)"))||(("(p349!=1)")&&(G("(p509!=1)"))))))U((X(G("(p349!=1)")))||((X(("(p349!=1)")U((G("(p349!=1)"))|...224
Formula 0 simplified : X(F!"(p509!=1)" U !"(p349!=1)") R (XF!"(p349!=1)" & (!"((p127==1)||(p398==1))" | X(F!"(p509!=1)" U !"(p349!=1)")))
Detected timeout of ITS tools.
[2025-06-04 05:02:41] [INFO ] Flatten gal took : 20 ms
[2025-06-04 05:02:41] [INFO ] Applying decomposition
[2025-06-04 05:02:41] [INFO ] Flatten gal took : 19 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/graph10065167200364318507.txt' '-o' '/tmp/graph10065167200364318507.bin' '-w' '/tmp/graph10065167200364318507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10065167200364318507.bin' '-l' '-1' '-v' '-w' '/tmp/graph10065167200364318507.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:02:41] [INFO ] Decomposing Gal with order
[2025-06-04 05:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:02:41] [INFO ] Removed a total of 170 redundant transitions.
[2025-06-04 05:02:41] [INFO ] Flatten gal took : 98 ms
[2025-06-04 05:02:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 24 ms.
[2025-06-04 05:02:41] [INFO ] Time to serialize gal into /tmp/LTL12036152079320674440.gal : 11 ms
[2025-06-04 05:02:41] [INFO ] Time to serialize properties into /tmp/LTL3947804080417959497.ltl : 1 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/LTL12036152079320674440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3947804080417959497.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !(((X(("(u74.p349!=1)")U((G("(u74.p349!=1)"))||(("(u74.p349!=1)")&&(G("(i21.i0.u113.p509!=1)"))))))U((X(G("(u74.p349!=1)")))||((X(("(u...297
Formula 0 simplified : X(F!"(i21.i0.u113.p509!=1)" U !"(u74.p349!=1)") R (XF!"(u74.p349!=1)" & (!"((i5.i1.u23.p127==1)||(i17.i2.u87.p398==1))" | X(F!"(i21....194
Reverse transition relation is NOT exact ! Due to transitions t100, t220, t455, t460, u74.t210, i2.i0.t395, i2.i0.t407, i2.i0.t412, i2.i0.t414, i2.i0.t416,...1826
Computing Next relation with stutter on 3.70995e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property HealthRecord-PT-17-LTLFireability-08 finished in 301887 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(p0))'
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 445 edges and 386 vertex of which 64 / 386 are part of one of the 21 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 342 transition count 316
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 161 rules applied. Total rules applied 306 place count 198 transition count 299
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 316 place count 189 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 188 transition count 298
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 317 place count 188 transition count 291
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 331 place count 181 transition count 291
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 357 place count 155 transition count 246
Iterating global reduction 4 with 26 rules applied. Total rules applied 383 place count 155 transition count 246
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 388 place count 155 transition count 241
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 393 place count 150 transition count 241
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 403 place count 140 transition count 226
Iterating global reduction 6 with 10 rules applied. Total rules applied 413 place count 140 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 417 place count 140 transition count 222
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 418 place count 139 transition count 220
Iterating global reduction 7 with 1 rules applied. Total rules applied 419 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 420 place count 138 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 421 place count 138 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 422 place count 137 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 423 place count 137 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 426 place count 137 transition count 213
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 524 place count 88 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 531 place count 88 transition count 154
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 540 place count 79 transition count 136
Iterating global reduction 9 with 9 rules applied. Total rules applied 549 place count 79 transition count 136
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 552 place count 76 transition count 132
Iterating global reduction 9 with 3 rules applied. Total rules applied 555 place count 76 transition count 132
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 556 place count 75 transition count 128
Iterating global reduction 9 with 1 rules applied. Total rules applied 557 place count 75 transition count 128
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 563 place count 72 transition count 164
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 564 place count 71 transition count 162
Iterating global reduction 9 with 1 rules applied. Total rules applied 565 place count 71 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 567 place count 70 transition count 174
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 568 place count 69 transition count 170
Iterating global reduction 9 with 1 rules applied. Total rules applied 569 place count 69 transition count 170
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 570 place count 68 transition count 166
Iterating global reduction 9 with 1 rules applied. Total rules applied 571 place count 68 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 576 place count 68 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 593 place count 68 transition count 144
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 594 place count 67 transition count 143
Iterating global reduction 10 with 1 rules applied. Total rules applied 595 place count 67 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 597 place count 66 transition count 154
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 598 place count 65 transition count 151
Iterating global reduction 10 with 1 rules applied. Total rules applied 599 place count 65 transition count 151
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 602 place count 62 transition count 146
Iterating global reduction 10 with 3 rules applied. Total rules applied 605 place count 62 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 616 place count 62 transition count 135
Applied a total of 616 rules in 60 ms. Remains 62 /386 variables (removed 324) and now considering 135/511 (removed 376) transitions.
[2025-06-04 05:02:56] [INFO ] Flow matrix only has 125 transitions (discarded 10 similar events)
// Phase 1: matrix 125 rows 62 cols
[2025-06-04 05:02:56] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:56] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-04 05:02:56] [INFO ] Flow matrix only has 125 transitions (discarded 10 similar events)
[2025-06-04 05:02:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-04 05:02:57] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:02:57] [INFO ] Redundant transitions in 47 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-04 05:02:57] [INFO ] Flow matrix only has 125 transitions (discarded 10 similar events)
[2025-06-04 05:02:57] [INFO ] Invariant cache hit.
[2025-06-04 05:02:57] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:58] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:58] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 124/186 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 127 unsolved in 10417 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 124/186 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 22/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 127/224 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 1/187 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/187 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 225 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31226ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 31240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/386 places, 135/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31755 ms. Remains : 62/386 places, 135/511 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-09 finished in 31871 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 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 446 edges and 386 vertex of which 64 / 386 are part of one of the 21 SCC in 2 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 342 transition count 316
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 161 rules applied. Total rules applied 306 place count 198 transition count 299
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 315 place count 189 transition count 299
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 315 place count 189 transition count 292
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 329 place count 182 transition count 292
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 156 transition count 247
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 156 transition count 247
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 386 place count 156 transition count 242
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 391 place count 151 transition count 242
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 401 place count 141 transition count 227
Iterating global reduction 5 with 10 rules applied. Total rules applied 411 place count 141 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 415 place count 141 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 416 place count 140 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 417 place count 140 transition count 221
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 139 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 139 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 420 place count 138 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 138 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 424 place count 138 transition count 214
Performed 50 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 524 place count 88 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 531 place count 88 transition count 154
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 540 place count 79 transition count 136
Iterating global reduction 8 with 9 rules applied. Total rules applied 549 place count 79 transition count 136
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 552 place count 76 transition count 132
Iterating global reduction 8 with 3 rules applied. Total rules applied 555 place count 76 transition count 132
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 75 transition count 128
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 75 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 565 place count 71 transition count 179
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 70 transition count 177
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 70 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 569 place count 69 transition count 189
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 570 place count 68 transition count 185
Iterating global reduction 8 with 1 rules applied. Total rules applied 571 place count 68 transition count 185
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 572 place count 67 transition count 181
Iterating global reduction 8 with 1 rules applied. Total rules applied 573 place count 67 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 578 place count 67 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 599 place count 67 transition count 155
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 600 place count 66 transition count 154
Iterating global reduction 9 with 1 rules applied. Total rules applied 601 place count 66 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 602 place count 66 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 604 place count 65 transition count 164
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 605 place count 64 transition count 161
Iterating global reduction 10 with 1 rules applied. Total rules applied 606 place count 64 transition count 161
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 609 place count 61 transition count 156
Iterating global reduction 10 with 3 rules applied. Total rules applied 612 place count 61 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 623 place count 61 transition count 145
Applied a total of 623 rules in 69 ms. Remains 61 /386 variables (removed 325) and now considering 145/511 (removed 366) transitions.
[2025-06-04 05:03:28] [INFO ] Flow matrix only has 131 transitions (discarded 14 similar events)
// Phase 1: matrix 131 rows 61 cols
[2025-06-04 05:03:28] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:03:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 05:03:28] [INFO ] Flow matrix only has 131 transitions (discarded 14 similar events)
[2025-06-04 05:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:03:28] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-04 05:03:28] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:03:28] [INFO ] Redundant transitions in 25 ms returned []
Running 137 sub problems to find dead transitions.
[2025-06-04 05:03:28] [INFO ] Flow matrix only has 131 transitions (discarded 14 similar events)
[2025-06-04 05:03:28] [INFO ] Invariant cache hit.
[2025-06-04 05:03:28] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:29] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:29] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 130/191 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 137 unsolved in 9674 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:39] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:40] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 130/191 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 137/233 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 234 constraints, problems are : Problem set: 0 solved, 137 unsolved in 22648 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32376ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 32378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/386 places, 145/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32710 ms. Remains : 61/386 places, 145/511 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-10 finished in 32769 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(p1) U (X(G(p1))||(p2&&X(p1)&&(X(X(p3)) U ((p3&&X(X(p3)))||X(X(G(p3))))))))))'
Support contains 4 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 372 transition count 492
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 372 transition count 492
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 372 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 368 transition count 484
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 368 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 365 transition count 478
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 365 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 363 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 363 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 361 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 361 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 361 transition count 468
Applied a total of 57 rules in 39 ms. Remains 361 /386 variables (removed 25) and now considering 468/511 (removed 43) transitions.
// Phase 1: matrix 468 rows 361 cols
[2025-06-04 05:04:01] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:04:01] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-04 05:04:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:04:02] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2025-06-04 05:04:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:18] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:18] [INFO ] Deduced a trap composed of 135 places in 367 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:19] [INFO ] Deduced a trap composed of 107 places in 353 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:19] [INFO ] Deduced a trap composed of 85 places in 347 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:20] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:20] [INFO ] Deduced a trap composed of 43 places in 355 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:21] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:21] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:22] [INFO ] Deduced a trap composed of 114 places in 335 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:22] [INFO ] Deduced a trap composed of 137 places in 329 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:22] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:23] [INFO ] Deduced a trap composed of 191 places in 311 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:23] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:24] [INFO ] Deduced a trap composed of 136 places in 300 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:25] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:26] [INFO ] Deduced a trap composed of 137 places in 317 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:27] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:27] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:28] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:29] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/829 variables, and 38 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:38] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:39] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:39] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:39] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:41] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:42] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:42] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:43] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:44] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:44] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:45] [INFO ] Deduced a trap composed of 66 places in 308 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:47] [INFO ] Deduced a trap composed of 45 places in 357 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:48] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:51] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:54] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:54] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:56] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:04:56] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:00] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:01] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:01] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:01] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:02] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:02] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 26 ms to minimize.
SMT process timed out in 60241ms, After SMT, problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 361/386 places, 468/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60923 ms. Remains : 361/386 places, 468/511 transitions.
Stuttering acceptance computed with spot in 1627 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 300 ms.
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Computed a total of 111 stabilizing places and 119 stable transitions
Computed a total of 111 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p3 p1)), (X p3), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p3 p1))), (X (NOT (AND p0 (NOT p2) p3 p1))), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X p0), (X (AND p2 p3 p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p3 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p2 p3 p1)))), (X (X (NOT (AND p0 (NOT p2) p3 p1)))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X p0)), (X (X (AND p2 p3 p1))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 49 factoid took 125 ms. Reduced automaton from 27 states, 153 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLFireability-11 finished in 63342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 442 edges and 386 vertex of which 59 / 386 are part of one of the 20 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 346 transition count 319
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 163 rules applied. Total rules applied 310 place count 200 transition count 302
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 319 place count 191 transition count 302
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 319 place count 191 transition count 295
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 333 place count 184 transition count 295
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 359 place count 158 transition count 250
Iterating global reduction 3 with 26 rules applied. Total rules applied 385 place count 158 transition count 250
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 390 place count 158 transition count 245
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 395 place count 153 transition count 245
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 405 place count 143 transition count 230
Iterating global reduction 5 with 10 rules applied. Total rules applied 415 place count 143 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 418 place count 143 transition count 227
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 419 place count 142 transition count 225
Iterating global reduction 6 with 1 rules applied. Total rules applied 420 place count 142 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 421 place count 141 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 141 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 423 place count 140 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 424 place count 140 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 427 place count 140 transition count 218
Performed 50 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 527 place count 90 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 534 place count 90 transition count 158
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 543 place count 81 transition count 140
Iterating global reduction 8 with 9 rules applied. Total rules applied 552 place count 81 transition count 140
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 555 place count 78 transition count 136
Iterating global reduction 8 with 3 rules applied. Total rules applied 558 place count 78 transition count 136
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 559 place count 77 transition count 132
Iterating global reduction 8 with 1 rules applied. Total rules applied 560 place count 77 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 566 place count 74 transition count 168
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 567 place count 73 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 568 place count 73 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 570 place count 72 transition count 178
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 571 place count 71 transition count 174
Iterating global reduction 8 with 1 rules applied. Total rules applied 572 place count 71 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 573 place count 70 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 574 place count 70 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 579 place count 70 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 596 place count 70 transition count 148
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 597 place count 69 transition count 147
Iterating global reduction 9 with 1 rules applied. Total rules applied 598 place count 69 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 599 place count 69 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 601 place count 68 transition count 157
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 602 place count 67 transition count 154
Iterating global reduction 10 with 1 rules applied. Total rules applied 603 place count 67 transition count 154
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 606 place count 64 transition count 149
Iterating global reduction 10 with 3 rules applied. Total rules applied 609 place count 64 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 620 place count 64 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 621 place count 64 transition count 138
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 622 place count 63 transition count 137
Iterating global reduction 10 with 1 rules applied. Total rules applied 623 place count 63 transition count 137
Applied a total of 623 rules in 52 ms. Remains 63 /386 variables (removed 323) and now considering 137/511 (removed 374) transitions.
[2025-06-04 05:05:04] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
// Phase 1: matrix 128 rows 63 cols
[2025-06-04 05:05:04] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:05:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 05:05:04] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
[2025-06-04 05:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:05:04] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-04 05:05:04] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:05:05] [INFO ] Redundant transitions in 23 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-04 05:05:05] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
[2025-06-04 05:05:05] [INFO ] Invariant cache hit.
[2025-06-04 05:05:05] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:06] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:06] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 127/190 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 97 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8596 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:14] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 127/190 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 22/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 129/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 227 constraints, problems are : Problem set: 0 solved, 129 unsolved in 17503 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26138ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 26139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/386 places, 137/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26421 ms. Remains : 63/386 places, 137/511 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-12 finished in 26549 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(G(p0)))&&F(p1)))'
Support contains 4 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 371 transition count 490
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 371 transition count 490
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 371 transition count 487
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 367 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 367 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 364 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 364 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 362 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 362 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 361 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 361 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 361 transition count 470
Applied a total of 54 rules in 33 ms. Remains 361 /386 variables (removed 25) and now considering 470/511 (removed 41) transitions.
// Phase 1: matrix 470 rows 361 cols
[2025-06-04 05:05:31] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:05:31] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-04 05:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:05:31] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2025-06-04 05:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:48] [INFO ] Deduced a trap composed of 32 places in 369 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:49] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:49] [INFO ] Deduced a trap composed of 191 places in 337 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:50] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:50] [INFO ] Deduced a trap composed of 45 places in 347 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:50] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:56] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:56] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:57] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:57] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:05:57] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 14 ms to minimize.
(s186 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/831 variables, and 29 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:08] [INFO ] Deduced a trap composed of 136 places in 288 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:09] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:09] [INFO ] Deduced a trap composed of 62 places in 373 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:10] [INFO ] Deduced a trap composed of 62 places in 355 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:10] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:10] [INFO ] Deduced a trap composed of 50 places in 340 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:11] [INFO ] Deduced a trap composed of 85 places in 312 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:12] [INFO ] Deduced a trap composed of 45 places in 378 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:13] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:13] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:14] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:15] [INFO ] Deduced a trap composed of 55 places in 285 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:15] [INFO ] Deduced a trap composed of 61 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:16] [INFO ] Deduced a trap composed of 61 places in 301 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:17] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:17] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:18] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:18] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:18] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:19] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:23] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:24] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:24] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:29] [INFO ] Deduced a trap composed of 71 places in 356 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:29] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:30] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:30] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:31] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:31] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:31] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 35 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/831 variables, and 59 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/469 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 361/386 places, 470/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 361/386 places, 470/511 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-13 finished in 60979 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(G(p0))))'
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 370 transition count 489
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 370 transition count 489
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 370 transition count 486
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 365 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 365 transition count 478
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 361 transition count 471
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 361 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 359 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 359 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 357 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 357 transition count 465
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 357 transition count 461
Applied a total of 65 rules in 56 ms. Remains 357 /386 variables (removed 29) and now considering 461/511 (removed 50) transitions.
// Phase 1: matrix 461 rows 357 cols
[2025-06-04 05:06:32] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:06:32] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-04 05:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:06:33] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-04 05:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:49] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:49] [INFO ] Deduced a trap composed of 134 places in 338 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:50] [INFO ] Deduced a trap composed of 107 places in 347 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:50] [INFO ] Deduced a trap composed of 85 places in 334 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:51] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:51] [INFO ] Deduced a trap composed of 191 places in 316 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:51] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:52] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:52] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:53] [INFO ] Deduced a trap composed of 135 places in 323 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:53] [INFO ] Deduced a trap composed of 70 places in 347 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:54] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:54] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:54] [INFO ] Deduced a trap composed of 60 places in 319 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:55] [INFO ] Deduced a trap composed of 134 places in 259 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:58] [INFO ] Deduced a trap composed of 84 places in 320 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:58] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:58] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:59] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:06:59] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 38 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:09] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:10] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:10] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:10] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:10] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:11] [INFO ] Deduced a trap composed of 45 places in 338 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:12] [INFO ] Deduced a trap composed of 64 places in 352 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:13] [INFO ] Deduced a trap composed of 113 places in 367 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:13] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:14] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:15] [INFO ] Deduced a trap composed of 70 places in 272 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:15] [INFO ] Deduced a trap composed of 70 places in 270 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:16] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:17] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:17] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:18] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:20] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:20] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:25] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:26] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:27] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:27] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:31] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:32] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:32] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/818 variables, and 63 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 0/460 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 357/386 places, 461/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61003 ms. Remains : 357/386 places, 461/511 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-14
Product exploration explored 100000 steps with 872 reset in 197 ms.
Product exploration explored 100000 steps with 880 reset in 230 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (350 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 904042 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 904042 steps, saw 186407 distinct states, run finished after 3005 ms. (steps per millisecond=300 ) properties seen :0
[2025-06-04 05:07:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:37] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/357 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:37] [INFO ] Deduced a trap composed of 53 places in 292 ms of which 36 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/818 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:38] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/357 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:38] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:38] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 461/818 variables, 357/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/818 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1943ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Applied a total of 0 rules in 9 ms. Remains 357 /357 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-04 05:07:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:07:39] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-04 05:07:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:07:40] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-04 05:07:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:56] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:57] [INFO ] Deduced a trap composed of 134 places in 347 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:57] [INFO ] Deduced a trap composed of 107 places in 323 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:57] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:58] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:58] [INFO ] Deduced a trap composed of 191 places in 323 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:59] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:07:59] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:00] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:00] [INFO ] Deduced a trap composed of 135 places in 321 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:01] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:01] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:01] [INFO ] Deduced a trap composed of 60 places in 344 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:02] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:02] [INFO ] Deduced a trap composed of 134 places in 256 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:05] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:05] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:06] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:06] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:06] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 38 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:16] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:17] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:17] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:17] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:17] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:18] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:19] [INFO ] Deduced a trap composed of 64 places in 345 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:20] [INFO ] Deduced a trap composed of 113 places in 359 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:20] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:21] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:22] [INFO ] Deduced a trap composed of 70 places in 269 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:23] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:23] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:24] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:24] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:25] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:27] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:27] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:33] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:33] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:34] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:34] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:38] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:39] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:39] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:40] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 28 ms to minimize.
SMT process timed out in 60176ms, After SMT, problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 61063 ms. Remains : 357/357 places, 461/461 transitions.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (348 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (60 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 970067 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970067 steps, saw 201198 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2025-06-04 05:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:44] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/357 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:44] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 35 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/818 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:45] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/357 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:45] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:45] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 461/818 variables, 357/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/818 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2073ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 876 reset in 208 ms.
Product exploration explored 100000 steps with 879 reset in 240 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Graph (trivial) has 402 edges and 357 vertex of which 60 / 357 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 318 transition count 416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 143 place count 318 transition count 410
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 143 place count 318 transition count 410
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 318 transition count 410
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 244 place count 222 transition count 309
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 340 place count 222 transition count 309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 344 place count 218 transition count 305
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 218 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 218 transition count 302
Performed 60 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 411 place count 218 transition count 328
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 420 place count 218 transition count 319
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 472 place count 166 transition count 251
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 52 rules applied. Total rules applied 524 place count 166 transition count 251
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 161 transition count 244
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 161 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 540 place count 155 transition count 226
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 546 place count 155 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 549 place count 155 transition count 223
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 565 place count 155 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 566 place count 155 transition count 360
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 583 place count 138 transition count 313
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 6 with 17 rules applied. Total rules applied 600 place count 138 transition count 313
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 628 place count 138 transition count 285
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 634 place count 132 transition count 266
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 640 place count 132 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 641 place count 132 transition count 281
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 644 place count 129 transition count 274
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 647 place count 129 transition count 274
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 650 place count 126 transition count 269
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 653 place count 126 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 654 place count 125 transition count 268
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 655 place count 125 transition count 268
Deduced a syphon composed of 64 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 658 place count 125 transition count 265
Deduced a syphon composed of 64 places in 1 ms
Applied a total of 658 rules in 79 ms. Remains 125 /357 variables (removed 232) and now considering 265/461 (removed 196) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:08:47] [INFO ] Redundant transitions in 31 ms returned []
Running 257 sub problems to find dead transitions.
[2025-06-04 05:08:47] [INFO ] Flow matrix only has 250 transitions (discarded 15 similar events)
// Phase 1: matrix 250 rows 125 cols
[2025-06-04 05:08:47] [INFO ] Computed 9 invariants in 1 ms
[2025-06-04 05:08:47] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:50] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:50] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:50] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:08:51] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 10/19 constraints. Problems are: Problem set: 93 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/19 constraints. Problems are: Problem set: 93 solved, 164 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 4 (OVERLAPS) 249/374 variables, 125/144 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 20/164 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/165 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/165 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/165 constraints. Problems are: Problem set: 114 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 165 constraints, problems are : Problem set: 114 solved, 143 unsolved in 16914 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 114 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 65/125 variables, 9/9 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 10/19 constraints. Problems are: Problem set: 114 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:09:05] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:09:05] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/21 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/21 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 249/374 variables, 125/146 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 20/166 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 143/309 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/309 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/375 variables, 1/310 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/310 constraints. Problems are: Problem set: 114 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 310 constraints, problems are : Problem set: 114 solved, 143 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 143/257 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47030ms problems are : Problem set: 114 solved, 143 unsolved
Search for dead transitions found 114 dead transitions in 47031ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) removed 114 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/357 places, 151/461 transitions.
Graph (complete) has 266 edges and 125 vertex of which 61 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 61 /125 variables (removed 64) and now considering 151/151 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/357 places, 151/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47153 ms. Remains : 61/357 places, 151/461 transitions.
Built C files in :
/tmp/ltsmin15344742762105768190
[2025-06-04 05:09:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15344742762105768190
Running compilation step : cd /tmp/ltsmin15344742762105768190;'/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 1099 ms.
Running link step : cd /tmp/ltsmin15344742762105768190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15344742762105768190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2125866530344097556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Applied a total of 0 rules in 6 ms. Remains 357 /357 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 357 cols
[2025-06-04 05:09:49] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:09:49] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-04 05:09:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:09:50] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-04 05:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:05] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:06] [INFO ] Deduced a trap composed of 134 places in 336 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:06] [INFO ] Deduced a trap composed of 107 places in 353 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:06] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:07] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:07] [INFO ] Deduced a trap composed of 191 places in 320 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:08] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:08] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:09] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:09] [INFO ] Deduced a trap composed of 135 places in 329 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:10] [INFO ] Deduced a trap composed of 70 places in 325 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:10] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:10] [INFO ] Deduced a trap composed of 60 places in 340 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:11] [INFO ] Deduced a trap composed of 60 places in 344 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:11] [INFO ] Deduced a trap composed of 134 places in 272 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:13] [INFO ] Deduced a trap composed of 84 places in 294 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:14] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:14] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:14] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:15] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 38 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:26] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:26] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:27] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:27] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:27] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:28] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:29] [INFO ] Deduced a trap composed of 64 places in 364 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:29] [INFO ] Deduced a trap composed of 113 places in 237 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:30] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:31] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:31] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:32] [INFO ] Deduced a trap composed of 70 places in 287 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:33] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:33] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:34] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:35] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:36] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:36] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:42] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:42] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:43] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:43] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:46] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:47] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:48] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:49] [INFO ] Deduced a trap composed of 70 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:10:50] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 14 ms to minimize.
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 60730 ms. Remains : 357/357 places, 461/461 transitions.
Built C files in :
/tmp/ltsmin9330367538306077077
[2025-06-04 05:10:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9330367538306077077
Running compilation step : cd /tmp/ltsmin9330367538306077077;'/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 1060 ms.
Running link step : cd /tmp/ltsmin9330367538306077077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9330367538306077077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8269588024001809588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 05:11:05] [INFO ] Flatten gal took : 20 ms
[2025-06-04 05:11:05] [INFO ] Flatten gal took : 13 ms
[2025-06-04 05:11:05] [INFO ] Time to serialize gal into /tmp/LTL15423777204022483939.gal : 4 ms
[2025-06-04 05:11:05] [INFO ] Time to serialize properties into /tmp/LTL5600839119307666495.prop : 1 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/LTL15423777204022483939.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3270909747669328431.hoa' '-atoms' '/tmp/LTL5600839119307666495.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/LTL5600839119307666495.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3270909747669328431.hoa
Detected timeout of ITS tools.
[2025-06-04 05:11:20] [INFO ] Flatten gal took : 14 ms
[2025-06-04 05:11:20] [INFO ] Flatten gal took : 13 ms
[2025-06-04 05:11:20] [INFO ] Time to serialize gal into /tmp/LTL11534999057935624871.gal : 3 ms
[2025-06-04 05:11:20] [INFO ] Time to serialize properties into /tmp/LTL13521511198245412338.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/LTL11534999057935624871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13521511198245412338.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 : !((X(X(G("(p326!=1)")))))
Formula 0 simplified : XXF!"(p326!=1)"
Detected timeout of ITS tools.
[2025-06-04 05:11:35] [INFO ] Flatten gal took : 13 ms
[2025-06-04 05:11:35] [INFO ] Applying decomposition
[2025-06-04 05:11:35] [INFO ] Flatten gal took : 13 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/graph7507825384178019472.txt' '-o' '/tmp/graph7507825384178019472.bin' '-w' '/tmp/graph7507825384178019472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7507825384178019472.bin' '-l' '-1' '-v' '-w' '/tmp/graph7507825384178019472.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:11:35] [INFO ] Decomposing Gal with order
[2025-06-04 05:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:11:35] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-04 05:11:36] [INFO ] Flatten gal took : 36 ms
[2025-06-04 05:11:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 6 ms.
[2025-06-04 05:11:36] [INFO ] Time to serialize gal into /tmp/LTL1188582676616961746.gal : 5 ms
[2025-06-04 05:11:36] [INFO ] Time to serialize properties into /tmp/LTL7311437342146057266.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/LTL1188582676616961746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7311437342146057266.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i10.u62.p326!=1)")))))
Formula 0 simplified : XXF!"(i10.u62.p326!=1)"
Reverse transition relation is NOT exact ! Due to transitions t101, t455, t460, i2.t432, i2.t431, i2.t425, i2.t416, i2.t415, i2.t413, i2.t412, i2.t410, i2....1566
Computing Next relation with stutter on 3.70995e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property HealthRecord-PT-17-LTLFireability-14 finished in 318815 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((p0 U (G(p0)||(p0&&G(p1))))) U ((p2&&X((p0 U (G(p0)||(p0&&G(p1))))))||X(G(p0)))))'
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(G(p0))))'
Found a Lengthening insensitive property : HealthRecord-PT-17-LTLFireability-14
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 386/386 places, 511/511 transitions.
Graph (trivial) has 445 edges and 386 vertex of which 64 / 386 are part of one of the 21 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 342 transition count 315
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 160 rules applied. Total rules applied 306 place count 197 transition count 300
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 315 place count 189 transition count 299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 318 place count 188 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 187 transition count 297
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 319 place count 187 transition count 290
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 333 place count 180 transition count 290
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 358 place count 155 transition count 247
Iterating global reduction 5 with 25 rules applied. Total rules applied 383 place count 155 transition count 247
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 387 place count 155 transition count 243
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 391 place count 151 transition count 243
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 400 place count 142 transition count 230
Iterating global reduction 7 with 9 rules applied. Total rules applied 409 place count 142 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 413 place count 142 transition count 226
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 414 place count 141 transition count 224
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 141 transition count 224
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 416 place count 140 transition count 222
Iterating global reduction 8 with 1 rules applied. Total rules applied 417 place count 140 transition count 222
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 418 place count 139 transition count 220
Iterating global reduction 8 with 1 rules applied. Total rules applied 419 place count 139 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 422 place count 139 transition count 217
Performed 51 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 524 place count 88 transition count 163
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 531 place count 88 transition count 156
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 540 place count 79 transition count 138
Iterating global reduction 10 with 9 rules applied. Total rules applied 549 place count 79 transition count 138
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 552 place count 76 transition count 134
Iterating global reduction 10 with 3 rules applied. Total rules applied 555 place count 76 transition count 134
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 556 place count 75 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 557 place count 75 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 565 place count 71 transition count 171
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 566 place count 70 transition count 169
Iterating global reduction 10 with 1 rules applied. Total rules applied 567 place count 70 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 569 place count 69 transition count 181
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 570 place count 68 transition count 177
Iterating global reduction 10 with 1 rules applied. Total rules applied 571 place count 68 transition count 177
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 572 place count 67 transition count 173
Iterating global reduction 10 with 1 rules applied. Total rules applied 573 place count 67 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 578 place count 67 transition count 168
Applied a total of 578 rules in 37 ms. Remains 67 /386 variables (removed 319) and now considering 168/511 (removed 343) transitions.
[2025-06-04 05:11:51] [INFO ] Flow matrix only has 157 transitions (discarded 11 similar events)
// Phase 1: matrix 157 rows 67 cols
[2025-06-04 05:11:51] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:11:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-04 05:11:51] [INFO ] Flow matrix only has 157 transitions (discarded 11 similar events)
[2025-06-04 05:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:11:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-04 05:11:51] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-04 05:11:51] [INFO ] Flow matrix only has 157 transitions (discarded 11 similar events)
[2025-06-04 05:11:51] [INFO ] Invariant cache hit.
[2025-06-04 05:11:51] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:11:52] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:11:53] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 156/223 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 98 constraints, problems are : Problem set: 0 solved, 153 unsolved in 12555 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:12:05] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 156/223 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 252 constraints, problems are : Problem set: 0 solved, 153 unsolved in 27264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39895ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 39895ms
Starting structural reductions in LI_LTL mode, iteration 1 : 67/386 places, 168/511 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 40248 ms. Remains : 67/386 places, 168/511 transitions.
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
Treatment of property HealthRecord-PT-17-LTLFireability-14 finished in 40478 ms.
FORMULA HealthRecord-PT-17-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-04 05:12:31] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4066976890301371213
[2025-06-04 05:12:31] [INFO ] Computing symmetric may disable matrix : 511 transitions.
[2025-06-04 05:12:31] [INFO ] Applying decomposition
[2025-06-04 05:12:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 05:12:31] [INFO ] Computing symmetric may enable matrix : 511 transitions.
[2025-06-04 05:12:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 05:12:31] [INFO ] Flatten gal took : 13 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/graph10556433293946674282.txt' '-o' '/tmp/graph10556433293946674282.bin' '-w' '/tmp/graph10556433293946674282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10556433293946674282.bin' '-l' '-1' '-v' '-w' '/tmp/graph10556433293946674282.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:12:31] [INFO ] Decomposing Gal with order
[2025-06-04 05:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:12:31] [INFO ] Removed a total of 185 redundant transitions.
[2025-06-04 05:12:31] [INFO ] Computing Do-Not-Accords matrix : 511 transitions.
[2025-06-04 05:12:31] [INFO ] Flatten gal took : 34 ms
[2025-06-04 05:12:31] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 05:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2025-06-04 05:12:31] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4066976890301371213
Running compilation step : cd /tmp/ltsmin4066976890301371213;'/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'
[2025-06-04 05:12:31] [INFO ] Time to serialize gal into /tmp/LTLFireability3037038452614893363.gal : 7 ms
[2025-06-04 05:12:31] [INFO ] Time to serialize properties into /tmp/LTLFireability8405238949034040745.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/LTLFireability3037038452614893363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8405238949034040745.ltl' '-c' '-stutter-deadlock'

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 : !(((X(("(u74.p349!=1)")U((G("(u74.p349!=1)"))||(("(u74.p349!=1)")&&(G("(i20.i1.u116.p509!=1)"))))))U((("((i5.i0.u22.p127==1)||(i16.i1....297
Formula 0 simplified : X(F!"(i20.i1.u116.p509!=1)" U !"(u74.p349!=1)") R (XF!"(u74.p349!=1)" & (!"((i5.i0.u22.p127==1)||(i16.i1.u91.p398==1))" | X(F!"(i20....194
Compilation finished in 1777 ms.
Running link step : cd /tmp/ltsmin4066976890301371213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4066976890301371213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))) U (((LTLAPp2==true)&&X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))))||X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t100, t426, t439, t440, t441, t442, t443, t452, t453, t454, t455, t456, t457, t458, t459, t46...2229
Computing Next relation with stutter on 5.68729e+06 deadlock states
155 unique states visited
152 strongly connected components in search stack
158 transitions explored
155 items max in DFS search stack
23766 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,237.759,2173684,1,0,3.25286e+06,21547,7259,8.0082e+06,1028,135614,8633884
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-17-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1889230 ms.

BK_STOP 1749014530650

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="HealthRecord-PT-17"
export BK_EXAMINATION="LTLFireability"
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 HealthRecord-PT-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867008300668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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