Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600500.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 CO4-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 260K 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 CO4-PT-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748608111156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:28:32] [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-05-30 12:28:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:28:32] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-05-30 12:28:32] [INFO ] Transformed 837 places.
[2025-05-30 12:28:32] [INFO ] Transformed 1122 transitions.
[2025-05-30 12:28:32] [INFO ] Found NUPN structural information;
[2025-05-30 12:28:32] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 163 places :
Symmetric choice reduction at 1 with 163 rule applications. Total rules 183 place count 541 transition count 774
Iterating global reduction 1 with 163 rules applied. Total rules applied 346 place count 541 transition count 774
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 352 place count 541 transition count 768
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 436 place count 457 transition count 666
Iterating global reduction 2 with 84 rules applied. Total rules applied 520 place count 457 transition count 666
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 523 place count 457 transition count 663
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 539 place count 441 transition count 639
Iterating global reduction 3 with 16 rules applied. Total rules applied 555 place count 441 transition count 639
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 558 place count 441 transition count 636
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 566 place count 433 transition count 628
Iterating global reduction 4 with 8 rules applied. Total rules applied 574 place count 433 transition count 628
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 579 place count 428 transition count 623
Iterating global reduction 4 with 5 rules applied. Total rules applied 584 place count 428 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 589 place count 428 transition count 618
Applied a total of 589 rules in 170 ms. Remains 428 /721 variables (removed 293) and now considering 618/942 (removed 324) transitions.
// Phase 1: matrix 618 rows 428 cols
[2025-05-30 12:28:32] [INFO ] Computed 7 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:33] [INFO ] Implicit Places using invariants in 292 ms returned [5, 359]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 325 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 426/721 places, 618/942 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 426/721 places, 618/942 transitions.
Support contains 32 out of 426 places after structural reductions.
[2025-05-30 12:28:33] [INFO ] Flatten gal took : 65 ms
[2025-05-30 12:28:33] [INFO ] Flatten gal took : 33 ms
[2025-05-30 12:28:33] [INFO ] Input system was already deterministic with 618 transitions.
Support contains 31 out of 426 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (795 resets) in 1449 ms. (27 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40003 steps (126 resets) in 296 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (142 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (154 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (159 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (158 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (97 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (96 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (159 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (140 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (112 resets) in 64 ms. (615 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (158 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (111 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (121 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (145 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
// Phase 1: matrix 618 rows 426 cols
[2025-05-30 12:28:34] [INFO ] Computed 5 invariants in 3 ms
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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 12/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 156/206 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 318/524 variables, 108/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 380/904 variables, 176/339 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/904 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 123/1027 variables, 80/419 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1027 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 15/1042 variables, 11/430 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 2/1044 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/1044 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1044/1044 variables, and 431 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1746 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 12/50 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 156/206 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 318/524 variables, 108/167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 380/904 variables, 176/352 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/904 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 123/1027 variables, 80/432 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1027 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 15/1042 variables, 11/443 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1042 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 2/1044 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/1044 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 444 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5920ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 883 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 19 stabilizing places and 34 stable transitions
Graph (complete) has 918 edges and 426 vertex of which 422 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 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))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 414 transition count 603
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 414 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 413 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 411 transition count 598
Applied a total of 32 rules in 35 ms. Remains 411 /426 variables (removed 15) and now considering 598/618 (removed 20) transitions.
// Phase 1: matrix 598 rows 411 cols
[2025-05-30 12:28:42] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:42] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:28:42] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 597 sub problems to find dead transitions.
[2025-05-30 12:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/1009 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:29:07] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:29:07] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 419 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/1009 variables, 411/419 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 597/1016 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1016 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 411/426 places, 598/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60630 ms. Remains : 411/426 places, 598/618 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-16-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 894 edges and 411 vertex of which 408 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-00 finished in 61419 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(p1)||p0)&&(p2||X(p3)))))'
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 419 transition count 609
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 419 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 419 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 415 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 415 transition count 604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 414 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 414 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 413 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 412 transition count 599
Applied a total of 30 rules in 43 ms. Remains 412 /426 variables (removed 14) and now considering 599/618 (removed 19) transitions.
// Phase 1: matrix 599 rows 412 cols
[2025-05-30 12:29:43] [INFO ] Computed 5 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:43] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-30 12:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:44] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-05-30 12:29: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/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:30:08] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:30:08] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:30:09] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1018 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 412/426 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60831 ms. Remains : 412/426 places, 599/618 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Running random walk in product with property : CO4-PT-16-LTLFireability-01
Product exploration explored 100000 steps with 268 reset in 167 ms.
Product exploration explored 100000 steps with 459 reset in 115 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3), (X p1), (X p3)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
RANDOM walk for 40000 steps (700 resets) in 263 ms. (151 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (160 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (149 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
[2025-05-30 12:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/158 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/466 variables, 94/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 388/854 variables, 182/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/854 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/983 variables, 82/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/1005 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1005 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/1011 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/158 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/466 variables, 94/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 388/854 variables, 182/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/854 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 129/983 variables, 82/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 22/1005 variables, 14/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1005 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1011 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p2 p1 p3), (X p1), (X p3)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Support contains 5 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 599/599 transitions.
Applied a total of 0 rules in 9 ms. Remains 412 /412 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2025-05-30 12:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:46] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 12:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:47] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-05-30 12:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:11] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:12] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:13] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1018 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 412/412 places, 599/599 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3), (X p1), (X p3)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
RANDOM walk for 40000 steps (896 resets) in 109 ms. (363 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (148 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2025-05-30 12:31:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/158 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/466 variables, 94/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 388/854 variables, 182/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/854 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 129/983 variables, 82/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 22/1005 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1005 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/1011 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1011 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 121/158 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 308/466 variables, 94/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 388/854 variables, 182/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/854 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 129/983 variables, 82/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 22/1005 variables, 14/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1005 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1011 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 871ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 p2 p1 p3), (X p1), (X p3)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Product exploration explored 100000 steps with 274 reset in 97 ms.
Product exploration explored 100000 steps with 642 reset in 213 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Support contains 5 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 599/599 transitions.
Graph (trivial) has 439 edges and 412 vertex of which 2 / 412 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 894 edges and 411 vertex of which 408 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 408 transition count 595
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 408 transition count 592
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 148 place count 408 transition count 638
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 195 place count 408 transition count 638
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 229 place count 374 transition count 604
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 263 place count 374 transition count 604
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 311 place count 374 transition count 645
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 324 place count 374 transition count 632
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 351 place count 347 transition count 601
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 378 place count 347 transition count 601
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 382 place count 347 transition count 601
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 385 place count 347 transition count 598
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 393 place count 339 transition count 589
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 401 place count 339 transition count 589
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 403 place count 337 transition count 586
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 337 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 337 transition count 585
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 407 place count 336 transition count 584
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 408 place count 336 transition count 584
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 411 place count 336 transition count 584
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 414 place count 333 transition count 581
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 417 place count 333 transition count 581
Performed 54 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 471 place count 333 transition count 839
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 518 place count 333 transition count 792
Discarding 110 places :
Symmetric choice reduction at 6 with 110 rule applications. Total rules 628 place count 223 transition count 490
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 6 with 110 rules applied. Total rules applied 738 place count 223 transition count 490
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 767 place count 223 transition count 461
Discarding 65 places :
Symmetric choice reduction at 7 with 65 rule applications. Total rules 832 place count 158 transition count 327
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 7 with 65 rules applied. Total rules applied 897 place count 158 transition count 327
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 903 place count 158 transition count 321
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 916 place count 145 transition count 296
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 929 place count 145 transition count 296
Deduced a syphon composed of 75 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 953 place count 145 transition count 272
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 955 place count 143 transition count 270
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 957 place count 143 transition count 270
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 959 place count 143 transition count 318
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 961 place count 141 transition count 302
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 963 place count 141 transition count 302
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 963 rules in 193 ms. Remains 141 /412 variables (removed 271) and now considering 302/599 (removed 297) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:31:49] [INFO ] Redundant transitions in 14 ms returned []
Running 301 sub problems to find dead transitions.
[2025-05-30 12:31:49] [INFO ] Flow matrix only has 283 transitions (discarded 19 similar events)
// Phase 1: matrix 283 rows 141 cols
[2025-05-30 12:31:49] [INFO ] Computed 5 invariants in 2 ms
[2025-05-30 12:31:49] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:52] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:52] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 4/9 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 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 TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 4 (OVERLAPS) 282/423 variables, 141/150 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 25/175 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/175 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/424 variables, 1/176 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/176 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/176 constraints. Problems are: Problem set: 164 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 176 constraints, problems are : Problem set: 164 solved, 137 unsolved in 11976 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 141/141 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 164 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 12/79 variables, 5/5 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 4/9 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 273/352 variables, 79/88 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 25/113 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 137/250 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/250 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 71/423 variables, 62/312 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/312 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/424 variables, 1/313 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/313 constraints. Problems are: Problem set: 164 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/424 variables, 0/313 constraints. Problems are: Problem set: 164 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 313 constraints, problems are : Problem set: 164 solved, 137 unsolved in 18278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 141/141 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 137/301 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30314ms problems are : Problem set: 164 solved, 137 unsolved
Search for dead transitions found 164 dead transitions in 30315ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 141/412 places, 138/599 transitions.
Graph (complete) has 287 edges and 141 vertex of which 68 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 68 /141 variables (removed 73) and now considering 138/138 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/412 places, 138/599 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30542 ms. Remains : 68/412 places, 138/599 transitions.
Built C files in :
/tmp/ltsmin11609238222515121000
[2025-05-30 12:32:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11609238222515121000
Running compilation step : cd /tmp/ltsmin11609238222515121000;'/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 987 ms.
Running link step : cd /tmp/ltsmin11609238222515121000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11609238222515121000;'/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/stateBased2549519450962769448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 599/599 transitions.
Applied a total of 0 rules in 13 ms. Remains 412 /412 variables (removed 0) and now considering 599/599 (removed 0) transitions.
// Phase 1: matrix 599 rows 412 cols
[2025-05-30 12:32:35] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:35] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-05-30 12:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:33:00] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:33:00] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:33:01] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1018 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60517 ms. Remains : 412/412 places, 599/599 transitions.
Built C files in :
/tmp/ltsmin18170967001348016087
[2025-05-30 12:33:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18170967001348016087
Running compilation step : cd /tmp/ltsmin18170967001348016087;'/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 890 ms.
Running link step : cd /tmp/ltsmin18170967001348016087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18170967001348016087;'/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/stateBased13997953878818267477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 12:33:51] [INFO ] Flatten gal took : 27 ms
[2025-05-30 12:33:51] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:33:51] [INFO ] Time to serialize gal into /tmp/LTL1985545434988331464.gal : 6 ms
[2025-05-30 12:33:51] [INFO ] Time to serialize properties into /tmp/LTL16797071835750484938.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1985545434988331464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5197306555455465104.hoa' '-atoms' '/tmp/LTL16797071835750484938.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/LTL16797071835750484938.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5197306555455465104.hoa
Detected timeout of ITS tools.
[2025-05-30 12:34:06] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:34:06] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:34:06] [INFO ] Time to serialize gal into /tmp/LTL3451739456797627408.gal : 4 ms
[2025-05-30 12:34:06] [INFO ] Time to serialize properties into /tmp/LTL1852311976909220174.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/LTL3451739456797627408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1852311976909220174.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 : !((G((("((p265==0)||(p353==0))")||(("(p825==0)")||(X("((p353==0)||(p825==0))"))))&&(("(p103!=1)")||(X("(p529!=1)"))))))
Formula 0 simplified : F((!"((p265==0)||(p353==0))" & !"(p825==0)" & X!"((p353==0)||(p825==0))") | (!"(p103!=1)" & X!"(p529!=1)"))
Detected timeout of ITS tools.
[2025-05-30 12:34:21] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:34:21] [INFO ] Applying decomposition
[2025-05-30 12:34:21] [INFO ] Flatten gal took : 21 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/graph16966976263604700460.txt' '-o' '/tmp/graph16966976263604700460.bin' '-w' '/tmp/graph16966976263604700460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16966976263604700460.bin' '-l' '-1' '-v' '-w' '/tmp/graph16966976263604700460.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:34:21] [INFO ] Decomposing Gal with order
[2025-05-30 12:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:34:21] [INFO ] Removed a total of 398 redundant transitions.
[2025-05-30 12:34:21] [INFO ] Flatten gal took : 73 ms
[2025-05-30 12:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 17 ms.
[2025-05-30 12:34:21] [INFO ] Time to serialize gal into /tmp/LTL14738493178533908264.gal : 8 ms
[2025-05-30 12:34:21] [INFO ] Time to serialize properties into /tmp/LTL12362746830190615985.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/LTL14738493178533908264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12362746830190615985.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...256
Read 1 LTL properties
Checking formula 0 : !((G((("((i2.u40.p265==0)||(i7.u57.p353==0))")||(("(i5.u147.p825==0)")||(X("((i7.u57.p353==0)||(i5.u147.p825==0))"))))&&(("(i3.u6.p103...191
Formula 0 simplified : F((!"((i2.u40.p265==0)||(i7.u57.p353==0))" & !"(i5.u147.p825==0)" & X!"((i7.u57.p353==0)||(i5.u147.p825==0))") | (!"(i3.u6.p103!=1)"...181
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t86, t145, t155, t226, t252, t322, t487, t544, t576, i0.u24.t433, i1.i1.t381, i1.i1...925
Computing Next relation with stutter on 685439 deadlock states
42 unique states visited
42 strongly connected components in search stack
43 transitions explored
42 items max in DFS search stack
115 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,1.20825,61732,1,0,82139,7080,7204,196400,571,37209,190741
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-16-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-16-LTLFireability-01 finished in 279541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Graph (trivial) has 457 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 917 edges and 425 vertex of which 421 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 420 transition count 457
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 265 transition count 453
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 315 place count 265 transition count 403
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 415 place count 215 transition count 403
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 418 place count 212 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 421 place count 212 transition count 398
Performed 63 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 547 place count 149 transition count 321
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
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 3 with 18 rules applied. Total rules applied 565 place count 149 transition count 303
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 569 place count 147 transition count 301
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 573 place count 143 transition count 293
Iterating global reduction 5 with 4 rules applied. Total rules applied 577 place count 143 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 583 place count 140 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 584 place count 139 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 585 place count 139 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 586 place count 139 transition count 287
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 668 place count 98 transition count 333
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 688 place count 98 transition count 313
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 716 place count 70 transition count 201
Iterating global reduction 7 with 28 rules applied. Total rules applied 744 place count 70 transition count 201
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 762 place count 70 transition count 183
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 769 place count 63 transition count 145
Iterating global reduction 8 with 7 rules applied. Total rules applied 776 place count 63 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 781 place count 63 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 785 place count 61 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 807 place count 61 transition count 143
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 817 place count 61 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 819 place count 59 transition count 141
Applied a total of 819 rules in 61 ms. Remains 59 /426 variables (removed 367) and now considering 141/618 (removed 477) transitions.
[2025-05-30 12:34:23] [INFO ] Flow matrix only has 111 transitions (discarded 30 similar events)
// Phase 1: matrix 111 rows 59 cols
[2025-05-30 12:34:23] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 12:34:23] [INFO ] Flow matrix only has 111 transitions (discarded 30 similar events)
[2025-05-30 12:34:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 12:34:23] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:34:23] [INFO ] Redundant transitions in 4 ms returned []
Running 118 sub problems to find dead transitions.
[2025-05-30 12:34:23] [INFO ] Flow matrix only has 111 transitions (discarded 30 similar events)
[2025-05-30 12:34:23] [INFO ] Invariant cache hit.
[2025-05-30 12:34:23] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 110/169 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2749 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 110/169 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/170 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4989 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7759ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/426 places, 141/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7941 ms. Remains : 59/426 places, 141/618 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-02 finished in 8098 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(G(!p0)))) U X((p0||G(F(p1))))))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 413 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 413 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 410 transition count 598
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 410 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 410 transition count 597
Applied a total of 34 rules in 40 ms. Remains 410 /426 variables (removed 16) and now considering 597/618 (removed 21) transitions.
// Phase 1: matrix 597 rows 410 cols
[2025-05-30 12:34:31] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:34:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:31] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:34: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/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:34:55] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:34:55] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:08] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 410/426 places, 597/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 410/426 places, 597/618 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 2045 reset in 270 ms.
Product exploration explored 100000 steps with 1991 reset in 275 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (843 resets) in 99 ms. (400 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (137 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
[2025-05-30 12:35:33] [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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/46 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/247 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/259 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/277 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 344/621 variables, 157/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 241/862 variables, 120/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/862 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 122/984 variables, 72/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 17/1001 variables, 10/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1001 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/1007 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 415 constraints, problems are : Problem set: 0 solved, 2 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/46 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/247 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/259 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/277 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 344/621 variables, 157/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 241/862 variables, 120/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/862 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 122/984 variables, 72/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 17/1001 variables, 10/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1001 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 6/1007 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1007 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1007 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1278ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 597/597 transitions.
Graph (trivial) has 441 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 891 edges and 409 vertex of which 387 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 158 rules applied. Total rules applied 160 place count 387 transition count 417
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 304 place count 247 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 305 place count 246 transition count 413
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 305 place count 246 transition count 362
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 407 place count 195 transition count 362
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 410 place count 192 transition count 359
Iterating global reduction 3 with 3 rules applied. Total rules applied 413 place count 192 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 416 place count 192 transition count 356
Performed 59 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 534 place count 133 transition count 285
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 551 place count 133 transition count 268
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 557 place count 130 transition count 265
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 561 place count 126 transition count 257
Iterating global reduction 6 with 4 rules applied. Total rules applied 565 place count 126 transition count 257
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 573 place count 122 transition count 253
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 574 place count 122 transition count 252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 575 place count 121 transition count 250
Iterating global reduction 7 with 1 rules applied. Total rules applied 576 place count 121 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 577 place count 121 transition count 249
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 653 place count 83 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 732 place count 83 transition count 209
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 761 place count 54 transition count 140
Iterating global reduction 9 with 29 rules applied. Total rules applied 790 place count 54 transition count 140
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 810 place count 54 transition count 120
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 816 place count 48 transition count 95
Iterating global reduction 10 with 6 rules applied. Total rules applied 822 place count 48 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 826 place count 48 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 828 place count 47 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 831 place count 47 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 838 place count 47 transition count 88
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 839 place count 46 transition count 86
Iterating global reduction 12 with 1 rules applied. Total rules applied 840 place count 46 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 841 place count 46 transition count 85
Free-agglomeration rule applied 11 times.
Iterating global reduction 13 with 11 rules applied. Total rules applied 852 place count 46 transition count 74
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 865 place count 35 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 868 place count 35 transition count 72
Graph (complete) has 137 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 869 place count 34 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 872 place count 34 transition count 69
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 875 place count 34 transition count 69
Graph (complete) has 129 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 876 place count 33 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 879 place count 33 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 882 place count 33 transition count 66
Graph (complete) has 121 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 883 place count 32 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 886 place count 32 transition count 63
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 889 place count 32 transition count 63
Graph (complete) has 113 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 890 place count 31 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 893 place count 31 transition count 60
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 22 with 3 rules applied. Total rules applied 896 place count 31 transition count 60
Graph (complete) has 105 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
Iterating post reduction 22 with 1 rules applied. Total rules applied 897 place count 30 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 900 place count 30 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 901 place count 29 transition count 56
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t323.t487 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 25 vertex of which 3 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 24 with 5 rules applied. Total rules applied 906 place count 23 transition count 52
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 22 edges and 17 vertex of which 11 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 925 place count 8 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 26 with 32 rules applied. Total rules applied 957 place count 7 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 958 place count 7 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 2 Pre rules applied. Total rules applied 958 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 962 place count 5 transition count 6
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 28 with 2 rules applied. Total rules applied 964 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 965 place count 4 transition count 4
Applied a total of 965 rules in 54 ms. Remains 4 /410 variables (removed 406) and now considering 4/597 (removed 593) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 4/410 places, 4/597 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 231 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
[2025-05-30 12:35:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:35:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 12:35:35] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-30 12:35:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:35:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 12:35:35] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-30 12:35:35] [INFO ] Computed and/alt/rep : 574/1079/574 causal constraints (skipped 22 transitions) in 29 ms.
[2025-05-30 12:35:37] [INFO ] Added : 226 causal constraints over 46 iterations in 1665 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 597/597 transitions.
Graph (trivial) has 441 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 892 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 405 transition count 450
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 146 rules applied. Total rules applied 290 place count 263 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 262 transition count 446
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 291 place count 262 transition count 394
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 395 place count 210 transition count 394
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 517 place count 149 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 17 rules applied. Total rules applied 534 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 540 place count 146 transition count 299
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 544 place count 142 transition count 291
Iterating global reduction 5 with 4 rules applied. Total rules applied 548 place count 142 transition count 291
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 556 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 557 place count 137 transition count 285
Iterating global reduction 5 with 1 rules applied. Total rules applied 558 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 559 place count 137 transition count 284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 639 place count 97 transition count 328
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 659 place count 97 transition count 308
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 686 place count 70 transition count 200
Iterating global reduction 7 with 27 rules applied. Total rules applied 713 place count 70 transition count 200
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 731 place count 70 transition count 182
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 737 place count 64 transition count 150
Iterating global reduction 8 with 6 rules applied. Total rules applied 743 place count 64 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 747 place count 64 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 749 place count 63 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 768 place count 63 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 770 place count 61 transition count 142
Applied a total of 770 rules in 39 ms. Remains 61 /410 variables (removed 349) and now considering 142/597 (removed 455) transitions.
[2025-05-30 12:35:37] [INFO ] Flow matrix only has 110 transitions (discarded 32 similar events)
// Phase 1: matrix 110 rows 61 cols
[2025-05-30 12:35:37] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 12:35:37] [INFO ] Flow matrix only has 110 transitions (discarded 32 similar events)
[2025-05-30 12:35:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:35:37] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:35:37] [INFO ] Redundant transitions in 0 ms returned []
Running 119 sub problems to find dead transitions.
[2025-05-30 12:35:37] [INFO ] Flow matrix only has 110 transitions (discarded 32 similar events)
[2025-05-30 12:35:37] [INFO ] Invariant cache hit.
[2025-05-30 12:35:37] [INFO ] State equation strengthened by 3 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, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 109/170 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/171 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 69 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 109/170 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 119/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/171 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 188 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5215 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8328ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 8329ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/410 places, 142/597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8488 ms. Remains : 61/410 places, 142/597 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (3255 resets) in 578 ms. (69 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (273 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2025-05-30 12:35:46] [INFO ] Flow matrix only has 110 transitions (discarded 32 similar events)
[2025-05-30 12:35:46] [INFO ] Invariant cache hit.
[2025-05-30 12:35:46] [INFO ] State equation strengthened by 3 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/56 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/89 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/92 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/103 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/136 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 31/167 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/170 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/171 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/171 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/171 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/56 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/89 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/92 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/103 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 33/136 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/167 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/170 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/171 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 304 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
[2025-05-30 12:35:47] [INFO ] Flow matrix only has 110 transitions (discarded 32 similar events)
[2025-05-30 12:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:35:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 12:35:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-30 12:35:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:35:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 12:35:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-30 12:35:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:35:47] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-30 12:35:47] [INFO ] Computed and/alt/rep : 97/187/82 causal constraints (skipped 5 transitions) in 5 ms.
[2025-05-30 12:35:47] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), false, false]
Stuttering criterion allowed to conclude after 425 steps with 35 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 77082 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(X((G(p1)&&p0))))||(p1 U p2))))'
Support contains 6 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 419 transition count 609
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 419 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 419 transition count 608
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 415 transition count 604
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 415 transition count 604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 414 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 414 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 413 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 412 transition count 599
Applied a total of 30 rules in 37 ms. Remains 412 /426 variables (removed 14) and now considering 599/618 (removed 19) transitions.
// Phase 1: matrix 599 rows 412 cols
[2025-05-30 12:35:48] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:48] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-05-30 12:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:13] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:14] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:34] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1019 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 412/426 places, 599/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60561 ms. Remains : 412/426 places, 599/618 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-05 finished in 61013 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(((p1 U p2)&&p0))||G(p3))))'
Support contains 6 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 420 transition count 611
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 420 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 420 transition count 610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 416 transition count 606
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 416 transition count 606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 415 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 415 transition count 604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 414 transition count 603
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 414 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 413 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 413 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 413 transition count 601
Applied a total of 28 rules in 28 ms. Remains 413 /426 variables (removed 13) and now considering 601/618 (removed 17) transitions.
// Phase 1: matrix 601 rows 413 cols
[2025-05-30 12:36:49] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:49] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 12:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:49] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-05-30 12:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/419 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:15] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:15] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:37:16] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 422 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/422 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 600/1022 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1022 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 413/426 places, 601/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60542 ms. Remains : 413/426 places, 601/618 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-16-LTLFireability-06
Entered a terminal (fully accepting) state of product in 392 steps with 8 reset in 2 ms.
FORMULA CO4-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-06 finished in 60907 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 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Graph (trivial) has 453 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 917 edges and 425 vertex of which 421 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 420 transition count 458
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 160 rules applied. Total rules applied 315 place count 267 transition count 451
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 319 place count 263 transition count 451
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 319 place count 263 transition count 402
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 417 place count 214 transition count 402
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 419 place count 212 transition count 399
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 212 transition count 399
Performed 62 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 545 place count 150 transition count 320
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
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 3 with 16 rules applied. Total rules applied 561 place count 150 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 565 place count 148 transition count 302
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 569 place count 144 transition count 294
Iterating global reduction 5 with 4 rules applied. Total rules applied 573 place count 144 transition count 294
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 581 place count 140 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 582 place count 139 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 583 place count 139 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 139 transition count 287
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 666 place count 98 transition count 333
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 687 place count 98 transition count 312
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 715 place count 70 transition count 200
Iterating global reduction 7 with 28 rules applied. Total rules applied 743 place count 70 transition count 200
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 762 place count 70 transition count 181
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 769 place count 63 transition count 143
Iterating global reduction 8 with 7 rules applied. Total rules applied 776 place count 63 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 781 place count 63 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 783 place count 62 transition count 155
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 800 place count 62 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 802 place count 60 transition count 136
Applied a total of 802 rules in 40 ms. Remains 60 /426 variables (removed 366) and now considering 136/618 (removed 482) transitions.
[2025-05-30 12:37:50] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
// Phase 1: matrix 116 rows 60 cols
[2025-05-30 12:37:50] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:37:50] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-30 12:37:50] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
[2025-05-30 12:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:37:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-30 12:37:50] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:37:50] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-05-30 12:37:50] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
[2025-05-30 12:37:50] [INFO ] Invariant cache hit.
[2025-05-30 12:37:50] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 115/175 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 78 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 115/175 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 122/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 200 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5560 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8981ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8982ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/426 places, 136/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9232 ms. Remains : 60/426 places, 136/618 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 505 reset in 81 ms.
Product exploration explored 100000 steps with 494 reset in 72 ms.
Computed a total of 10 stabilizing places and 23 stable transitions
Computed a total of 10 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 4764 steps (329 resets) in 26 ms. (176 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 136/136 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2025-05-30 12:37:59] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
[2025-05-30 12:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:37:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-30 12:37:59] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
[2025-05-30 12:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-30 12:38:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:38:00] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-05-30 12:38:00] [INFO ] Flow matrix only has 116 transitions (discarded 20 similar events)
[2025-05-30 12:38:00] [INFO ] Invariant cache hit.
[2025-05-30 12:38:00] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 115/175 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 78 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 115/175 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 122/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 200 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5450 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8907ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9019 ms. Remains : 60/60 places, 136/136 transitions.
Computed a total of 10 stabilizing places and 23 stable transitions
Computed a total of 10 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 3423 steps (239 resets) in 17 ms. (190 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 712 reset in 48 ms.
Product exploration explored 100000 steps with 137 reset in 70 ms.
Built C files in :
/tmp/ltsmin16634712574601802272
[2025-05-30 12:38:09] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2025-05-30 12:38:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:38:09] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2025-05-30 12:38:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:38:09] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2025-05-30 12:38:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:38:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16634712574601802272
Running compilation step : cd /tmp/ltsmin16634712574601802272;'/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 273 ms.
Running link step : cd /tmp/ltsmin16634712574601802272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16634712574601802272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased190737779209010819.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-16-LTLFireability-07 finished in 19861 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||X((X(X(G(p1))) U (p0&&X(X(G(p1)))))))))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 413 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 413 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 410 transition count 598
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 410 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 410 transition count 597
Applied a total of 34 rules in 37 ms. Remains 410 /426 variables (removed 16) and now considering 597/618 (removed 21) transitions.
// Phase 1: matrix 597 rows 410 cols
[2025-05-30 12:38:10] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 12:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:10] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:38:35] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:38:35] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:38:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 410/426 places, 597/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60551 ms. Remains : 410/426 places, 597/618 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-09 finished in 60799 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(X((p0&&(!p1 U (G((!p1||G(p2)))||(p3&&X(p4)&&(!p1||G(p2))))))))))'
Support contains 6 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 413 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 413 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 410 transition count 598
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 410 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 410 transition count 597
Applied a total of 34 rules in 34 ms. Remains 410 /426 variables (removed 16) and now considering 597/618 (removed 21) transitions.
[2025-05-30 12:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:39:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 12:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:39:11] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:35] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:36] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 410/426 places, 597/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60532 ms. Remains : 410/426 places, 597/618 transitions.
Stuttering acceptance computed with spot in 403 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2) (NOT p4)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 20000 reset in 131 ms.
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 p0 p4)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 8 states, 18 edges and 5 AP (stutter sensitive) to 8 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2) (NOT p4)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (827 resets) in 448 ms. (89 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40003 steps (149 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (118 resets) in 34 ms. (1142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (116 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (114 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (95 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (153 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (151 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (155 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (157 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (116 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
[2025-05-30 12:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 23/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 132/171 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 308/479 variables, 100/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 375/854 variables, 175/319 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/854 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 122/976 variables, 78/397 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/976 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 13 (OVERLAPS) 23/999 variables, 14/411 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 0/411 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/1007 variables, 4/415 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 415 constraints, problems are : Problem set: 3 solved, 8 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/38 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 129/167 variables, 38/43 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 305/472 variables, 98/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 8/149 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 379/851 variables, 176/325 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/851 variables, 0/325 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 125/976 variables, 80/405 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/976 variables, 0/405 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 23/999 variables, 14/419 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 0/419 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/1007 variables, 4/423 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1007 variables, 0/423 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1007 variables, 0/423 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 423 constraints, problems are : Problem set: 3 solved, 8 unsolved in 2438 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4126ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 8 properties in 59 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p3 p0 p4), (G (OR (NOT p1) (NOT p2) p4)), (G (OR p1 p3 p4)), (G (OR (NOT p1) p2 p4))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 p3))), (F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR p1 (NOT p3) p4))), (F (NOT p2)), (F (NOT p3)), (F (NOT p4)), (F (NOT (AND p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 4 factoid took 534 ms. Reduced automaton from 8 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 5 out of 410 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 597/597 transitions.
Applied a total of 0 rules in 9 ms. Remains 410 /410 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2025-05-30 12:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:40:18] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-30 12:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:40:18] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:40: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/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:40:43] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:40:43] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:40:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 60492 ms. Remains : 410/410 places, 597/597 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p3 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (462 resets) in 142 ms. (279 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (162 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (115 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (117 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (158 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (159 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (117 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (119 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
[2025-05-30 12:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/38 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 129/167 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 305/472 variables, 98/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 379/851 variables, 176/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 125/976 variables, 80/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/976 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 23/999 variables, 14/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 8/1007 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 415 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/38 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 129/167 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 305/472 variables, 98/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 7/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 379/851 variables, 176/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/851 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 125/976 variables, 80/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/976 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 23/999 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 8/1007 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1007 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1007 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 422 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3419ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 538 ms.
Knowledge obtained : [(AND p2 (NOT p1) p3 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p1 p3))), (F (NOT p2)), (F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT p3)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 1 factoid took 357 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p2), (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 5 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 597/597 transitions.
Graph (trivial) has 433 edges and 410 vertex of which 2 / 410 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 892 edges and 409 vertex of which 406 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 406 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 146 place count 406 transition count 590
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 146 place count 406 transition count 636
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 193 place count 406 transition count 636
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 226 place count 373 transition count 603
Deduced a syphon composed of 155 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 259 place count 373 transition count 603
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 304 place count 373 transition count 647
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 317 place count 373 transition count 634
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 340 place count 350 transition count 607
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 363 place count 350 transition count 607
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 367 place count 350 transition count 607
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 372 place count 350 transition count 602
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 381 place count 341 transition count 592
Deduced a syphon composed of 177 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 390 place count 341 transition count 592
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 392 place count 339 transition count 589
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 394 place count 339 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 395 place count 339 transition count 588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 396 place count 338 transition count 587
Deduced a syphon composed of 175 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 338 transition count 587
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 400 place count 338 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 401 place count 338 transition count 586
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 405 place count 334 transition count 582
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 409 place count 334 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 410 place count 334 transition count 582
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 411 place count 333 transition count 581
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 412 place count 333 transition count 581
Performed 57 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 6 with 57 rules applied. Total rules applied 469 place count 333 transition count 858
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 520 place count 333 transition count 807
Discarding 113 places :
Symmetric choice reduction at 7 with 113 rule applications. Total rules 633 place count 220 transition count 496
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 7 with 113 rules applied. Total rules applied 746 place count 220 transition count 496
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 775 place count 220 transition count 467
Discarding 68 places :
Symmetric choice reduction at 8 with 68 rule applications. Total rules 843 place count 152 transition count 327
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 8 with 68 rules applied. Total rules applied 911 place count 152 transition count 327
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 918 place count 152 transition count 320
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 931 place count 139 transition count 295
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 13 rules applied. Total rules applied 944 place count 139 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 945 place count 139 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 952 place count 139 transition count 313
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 955 place count 136 transition count 295
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 958 place count 136 transition count 295
Deduced a syphon composed of 69 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 976 place count 136 transition count 277
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 977 place count 135 transition count 276
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 978 place count 135 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 979 place count 135 transition count 300
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 980 place count 134 transition count 291
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 981 place count 134 transition count 291
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 981 rules in 93 ms. Remains 134 /410 variables (removed 276) and now considering 291/597 (removed 306) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:41:25] [INFO ] Redundant transitions in 1 ms returned []
Running 290 sub problems to find dead transitions.
[2025-05-30 12:41:25] [INFO ] Flow matrix only has 282 transitions (discarded 9 similar events)
// Phase 1: matrix 282 rows 134 cols
[2025-05-30 12:41:25] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 12:41:25] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:41:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:41:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:41:27] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:41:27] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 4/9 constraints. Problems are: Problem set: 11 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 279 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 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
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 4 (OVERLAPS) 281/415 variables, 134/143 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 36/179 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/179 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/416 variables, 1/180 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/180 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/180 constraints. Problems are: Problem set: 156 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 180 constraints, problems are : Problem set: 156 solved, 134 unsolved in 12023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 156 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 12/77 variables, 5/5 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/9 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 272/349 variables, 77/86 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 36/122 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 134/256 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/256 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 66/415 variables, 57/313 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/313 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/416 variables, 1/314 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/314 constraints. Problems are: Problem set: 156 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/314 constraints. Problems are: Problem set: 156 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 314 constraints, problems are : Problem set: 156 solved, 134 unsolved in 18186 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 134/290 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30262ms problems are : Problem set: 156 solved, 134 unsolved
Search for dead transitions found 156 dead transitions in 30263ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) removed 156 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 134/410 places, 135/597 transitions.
Graph (complete) has 279 edges and 134 vertex of which 66 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 66 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 66 /134 variables (removed 68) and now considering 148/135 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/410 places, 148/597 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30374 ms. Remains : 66/410 places, 148/597 transitions.
Built C files in :
/tmp/ltsmin18216740469411494205
[2025-05-30 12:41:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18216740469411494205
Running compilation step : cd /tmp/ltsmin18216740469411494205;'/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 867 ms.
Running link step : cd /tmp/ltsmin18216740469411494205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18216740469411494205;'/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/stateBased6486117495750108331.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA CO4-PT-16-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-16-LTLFireability-10 finished in 166001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 413 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 413 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 410 transition count 598
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 410 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 410 transition count 597
Applied a total of 34 rules in 32 ms. Remains 410 /426 variables (removed 16) and now considering 597/618 (removed 21) transitions.
// Phase 1: matrix 597 rows 410 cols
[2025-05-30 12:41:56] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 12:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:21] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:21] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:34] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 410/426 places, 597/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 410/426 places, 597/618 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 60634 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(X(G(p0)))))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 418 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 413 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 413 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 411 transition count 599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 410 transition count 598
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 410 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 410 transition count 597
Applied a total of 34 rules in 35 ms. Remains 410 /426 variables (removed 16) and now considering 597/618 (removed 21) transitions.
[2025-05-30 12:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:42:57] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-05-30 12:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:43:22] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:43:22] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 417 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:43:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/418 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1014 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1014 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 410/426 places, 597/618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 410/426 places, 597/618 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 510 steps with 11 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 60694 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 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 618/618 transitions.
Graph (trivial) has 460 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 917 edges and 425 vertex of which 424 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 423 transition count 456
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 323 place count 264 transition count 453
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 323 place count 264 transition count 403
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 423 place count 214 transition count 403
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 426 place count 211 transition count 398
Iterating global reduction 2 with 3 rules applied. Total rules applied 429 place count 211 transition count 398
Performed 64 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 557 place count 147 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
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 2 with 16 rules applied. Total rules applied 573 place count 147 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 577 place count 145 transition count 298
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 581 place count 141 transition count 290
Iterating global reduction 4 with 4 rules applied. Total rules applied 585 place count 141 transition count 290
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 593 place count 137 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 594 place count 136 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 595 place count 136 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 596 place count 136 transition count 283
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 678 place count 95 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 698 place count 95 transition count 309
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 726 place count 67 transition count 197
Iterating global reduction 6 with 28 rules applied. Total rules applied 754 place count 67 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 773 place count 67 transition count 178
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 780 place count 60 transition count 140
Iterating global reduction 7 with 7 rules applied. Total rules applied 787 place count 60 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 792 place count 60 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 794 place count 59 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 814 place count 59 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 816 place count 57 transition count 130
Applied a total of 816 rules in 36 ms. Remains 57 /426 variables (removed 369) and now considering 130/618 (removed 488) transitions.
[2025-05-30 12:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
// Phase 1: matrix 102 rows 57 cols
[2025-05-30 12:43:58] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:43:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 12:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2025-05-30 12:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:43:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:43:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:43:58] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 12:43:58] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2025-05-30 12:43:58] [INFO ] Invariant cache hit.
[2025-05-30 12:43:58] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 65 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 172 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4518 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7213ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 7213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/426 places, 130/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7452 ms. Remains : 57/426 places, 130/618 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 7510 ms.
All properties solved by simple procedures.
Total runtime 933282 ms.

BK_STOP 1748609045715

--------------------
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="CO4-PT-16"
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 CO4-PT-16, 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 r044-tall-174854028600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-16.tgz
mv CO4-PT-16 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 ;