About the Execution of ITS-Tools for CloudReconfiguration-PT-316
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1278106.00 | 0.00 | 0.00 | FFFFTFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028200324.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 CloudReconfiguration-PT-316, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028200324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-316-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748597542009
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-316
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 09:32:23] [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 09:32:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 09:32:23] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-05-30 09:32:23] [INFO ] Transformed 2585 places.
[2025-05-30 09:32:23] [INFO ] Transformed 3095 transitions.
[2025-05-30 09:32:23] [INFO ] Found NUPN structural information;
[2025-05-30 09:32:23] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-316-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1058 place count 2070 transition count 2552
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1297 place count 1831 transition count 2313
Iterating global reduction 1 with 239 rules applied. Total rules applied 1536 place count 1831 transition count 2313
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1624 place count 1743 transition count 2225
Iterating global reduction 1 with 88 rules applied. Total rules applied 1712 place count 1743 transition count 2225
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1729 place count 1743 transition count 2208
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1777 place count 1695 transition count 2160
Iterating global reduction 2 with 48 rules applied. Total rules applied 1825 place count 1695 transition count 2160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1834 place count 1695 transition count 2151
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1871 place count 1658 transition count 2109
Iterating global reduction 3 with 37 rules applied. Total rules applied 1908 place count 1658 transition count 2109
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1935 place count 1631 transition count 2082
Iterating global reduction 3 with 27 rules applied. Total rules applied 1962 place count 1631 transition count 2082
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1987 place count 1606 transition count 2057
Iterating global reduction 3 with 25 rules applied. Total rules applied 2012 place count 1606 transition count 2057
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2037 place count 1581 transition count 2032
Iterating global reduction 3 with 25 rules applied. Total rules applied 2062 place count 1581 transition count 2032
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2083 place count 1560 transition count 1999
Iterating global reduction 3 with 21 rules applied. Total rules applied 2104 place count 1560 transition count 1999
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2112 place count 1552 transition count 1986
Iterating global reduction 3 with 8 rules applied. Total rules applied 2120 place count 1552 transition count 1986
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2128 place count 1544 transition count 1975
Iterating global reduction 3 with 8 rules applied. Total rules applied 2136 place count 1544 transition count 1975
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2138 place count 1544 transition count 1973
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2141 place count 1541 transition count 1970
Iterating global reduction 4 with 3 rules applied. Total rules applied 2144 place count 1541 transition count 1970
Applied a total of 2144 rules in 1852 ms. Remains 1541 /2585 variables (removed 1044) and now considering 1970/3095 (removed 1125) transitions.
// Phase 1: matrix 1970 rows 1541 cols
[2025-05-30 09:32:25] [INFO ] Computed 4 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:32:25] [INFO ] Implicit Places using invariants in 436 ms returned []
[2025-05-30 09:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:32:26] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Running 1969 sub problems to find dead transitions.
[2025-05-30 09:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1969 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/3511 variables, and 4 constraints, problems are : Problem set: 0 solved, 1969 unsolved in 32278 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 1969/1969 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1969 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1969 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/3511 variables, and 4 constraints, problems are : Problem set: 0 solved, 1969 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 0/1969 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62842ms problems are : Problem set: 0 solved, 1969 unsolved
Search for dead transitions found 0 dead transitions in 62904ms
Starting structural reductions in LTL mode, iteration 1 : 1541/2585 places, 1970/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66266 ms. Remains : 1541/2585 places, 1970/3095 transitions.
Support contains 29 out of 1541 places after structural reductions.
[2025-05-30 09:33:30] [INFO ] Flatten gal took : 120 ms
[2025-05-30 09:33:30] [INFO ] Flatten gal took : 70 ms
[2025-05-30 09:33:30] [INFO ] Input system was already deterministic with 1970 transitions.
RANDOM walk for 40000 steps (314 resets) in 2538 ms. (15 steps per ms) remains 22/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (11 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (11 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (9 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (10 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
[2025-05-30 09:33:31] [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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1960/3490 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3490 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/3492 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3492 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/3494 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3494 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 2/3496 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3496 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 2/3498 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3498/3511 variables, and 1538 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1534/1541 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1960/3490 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3490 variables, 22/1556 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3490 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 2/3492 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3492/3511 variables, and 1557 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1531/1541 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10058ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Graph (trivial) has 1820 edges and 1541 vertex of which 629 / 1541 are part of one of the 60 SCC in 7 ms
Free SCC test removed 569 places
Drop transitions (Empty/Sink Transition effects.) removed 714 transitions
Reduce isomorphic transitions removed 714 transitions.
Graph (complete) has 1429 edges and 972 vertex of which 962 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 513 rules applied. Total rules applied 515 place count 962 transition count 738
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 556 rules applied. Total rules applied 1071 place count 456 transition count 688
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 36 rules applied. Total rules applied 1107 place count 424 transition count 684
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 1113 place count 422 transition count 680
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 5 rules applied. Total rules applied 1118 place count 420 transition count 677
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 5 with 14 rules applied. Total rules applied 1132 place count 418 transition count 665
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 17 rules applied. Total rules applied 1149 place count 406 transition count 660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1151 place count 404 transition count 660
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 58 Pre rules applied. Total rules applied 1151 place count 404 transition count 602
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 1267 place count 346 transition count 602
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1278 place count 335 transition count 586
Iterating global reduction 8 with 11 rules applied. Total rules applied 1289 place count 335 transition count 586
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 8 with 3 rules applied. Total rules applied 1292 place count 335 transition count 583
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1295 place count 332 transition count 583
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1301 place count 326 transition count 577
Iterating global reduction 10 with 6 rules applied. Total rules applied 1307 place count 326 transition count 577
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1313 place count 326 transition count 571
Performed 149 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 11 with 298 rules applied. Total rules applied 1611 place count 177 transition count 331
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 1629 place count 177 transition count 313
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1632 place count 174 transition count 310
Iterating global reduction 12 with 3 rules applied. Total rules applied 1635 place count 174 transition count 310
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 1659 place count 162 transition count 296
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 1675 place count 162 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1679 place count 160 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1683 place count 160 transition count 274
Performed 38 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 14 with 76 rules applied. Total rules applied 1759 place count 122 transition count 313
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 14 with 29 rules applied. Total rules applied 1788 place count 122 transition count 284
Discarding 17 places :
Symmetric choice reduction at 15 with 17 rule applications. Total rules 1805 place count 105 transition count 250
Iterating global reduction 15 with 17 rules applied. Total rules applied 1822 place count 105 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1828 place count 105 transition count 244
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 1833 place count 100 transition count 234
Iterating global reduction 16 with 5 rules applied. Total rules applied 1838 place count 100 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1843 place count 100 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1845 place count 100 transition count 227
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1848 place count 100 transition count 224
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1851 place count 97 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1852 place count 97 transition count 223
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 18 with 8 rules applied. Total rules applied 1860 place count 97 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1861 place count 97 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1862 place count 96 transition count 222
Applied a total of 1862 rules in 224 ms. Remains 96 /1541 variables (removed 1445) and now considering 222/1970 (removed 1748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 96/1541 places, 222/1970 transitions.
RANDOM walk for 32814 steps (3116 resets) in 516 ms. (63 steps per ms) remains 0/22 properties
FORMULA CloudReconfiguration-PT-316-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-316-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2148 edges and 1541 vertex of which 1531 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.28 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)||X(X(X(F(p1)))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Graph (trivial) has 1872 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 3 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1402 edges and 904 vertex of which 894 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 893 transition count 734
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 512 rules applied. Total rules applied 1003 place count 405 transition count 710
Reduce places removed 12 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 1019 place count 393 transition count 706
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1023 place count 389 transition count 706
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1023 place count 389 transition count 659
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1117 place count 342 transition count 659
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1135 place count 324 transition count 630
Iterating global reduction 4 with 18 rules applied. Total rules applied 1153 place count 324 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 1158 place count 324 transition count 625
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1162 place count 320 transition count 625
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1173 place count 309 transition count 609
Iterating global reduction 6 with 11 rules applied. Total rules applied 1184 place count 309 transition count 609
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1191 place count 309 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 307 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 307 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1197 place count 305 transition count 594
Iterating global reduction 7 with 2 rules applied. Total rules applied 1199 place count 305 transition count 594
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1201 place count 303 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 1203 place count 303 transition count 590
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1205 place count 301 transition count 586
Iterating global reduction 7 with 2 rules applied. Total rules applied 1207 place count 301 transition count 586
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1209 place count 299 transition count 582
Iterating global reduction 7 with 2 rules applied. Total rules applied 1211 place count 299 transition count 582
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1213 place count 297 transition count 568
Iterating global reduction 7 with 2 rules applied. Total rules applied 1215 place count 297 transition count 568
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1216 place count 297 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1217 place count 296 transition count 567
Performed 136 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 9 with 272 rules applied. Total rules applied 1489 place count 160 transition count 354
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1501 place count 160 transition count 342
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1503 place count 159 transition count 341
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1507 place count 155 transition count 336
Iterating global reduction 11 with 4 rules applied. Total rules applied 1511 place count 155 transition count 336
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1533 place count 144 transition count 323
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1545 place count 144 transition count 311
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 12 with 2 rules applied. Total rules applied 1547 place count 143 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1548 place count 143 transition count 309
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1582 place count 126 transition count 343
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1598 place count 126 transition count 327
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 1606 place count 118 transition count 311
Iterating global reduction 14 with 8 rules applied. Total rules applied 1614 place count 118 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1618 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 15 with 37 rules applied. Total rules applied 1655 place count 118 transition count 270
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1656 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1657 place count 117 transition count 269
Applied a total of 1657 rules in 192 ms. Remains 117 /1541 variables (removed 1424) and now considering 269/1970 (removed 1701) transitions.
[2025-05-30 09:33:42] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 117 cols
[2025-05-30 09:33:42] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:42] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-30 09:33:42] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2025-05-30 09:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 09:33:42] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [9, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 283 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 269/1970 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 267
Applied a total of 2 rules in 11 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2025-05-30 09:33:42] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 113 cols
[2025-05-30 09:33:42] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:43] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 09:33:43] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2025-05-30 09:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 09:33:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1541 places, 267/1970 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 743 ms. Remains : 113/1541 places, 267/1970 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-00
Product exploration explored 100000 steps with 20255 reset in 301 ms.
Stuttering criterion allowed to conclude after 14133 steps with 2859 reset in 25 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-00 finished in 1375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(p1||X(F(p2)))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1531 transition count 1959
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1531 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1531 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1524 transition count 1950
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1524 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 1519 transition count 1945
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 1519 transition count 1945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 1516 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 1516 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 1513 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1512 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1511 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1510 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1510 transition count 1932
Applied a total of 65 rules in 495 ms. Remains 1510 /1541 variables (removed 31) and now considering 1932/1970 (removed 38) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2025-05-30 09:33:44] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:44] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-05-30 09:33:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:33:45] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 09:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1541 places, 1932/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62116 ms. Remains : 1510/1541 places, 1932/1970 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-01 finished in 62394 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 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Graph (trivial) has 1877 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 2 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1402 edges and 904 vertex of which 894 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 893 transition count 729
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 517 rules applied. Total rules applied 1013 place count 400 transition count 705
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1025 place count 388 transition count 705
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1025 place count 388 transition count 658
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1119 place count 341 transition count 658
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1137 place count 323 transition count 629
Iterating global reduction 3 with 18 rules applied. Total rules applied 1155 place count 323 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 1160 place count 323 transition count 624
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1164 place count 319 transition count 624
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1175 place count 308 transition count 608
Iterating global reduction 5 with 11 rules applied. Total rules applied 1186 place count 308 transition count 608
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1193 place count 308 transition count 601
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1195 place count 306 transition count 597
Iterating global reduction 6 with 2 rules applied. Total rules applied 1197 place count 306 transition count 597
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1199 place count 304 transition count 593
Iterating global reduction 6 with 2 rules applied. Total rules applied 1201 place count 304 transition count 593
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1202 place count 303 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 1203 place count 303 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1204 place count 302 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 1205 place count 302 transition count 589
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1206 place count 301 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 1207 place count 301 transition count 587
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1208 place count 300 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 1209 place count 300 transition count 580
Performed 138 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 138 places in 1 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 6 with 276 rules applied. Total rules applied 1485 place count 162 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1496 place count 162 transition count 352
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1500 place count 158 transition count 347
Iterating global reduction 7 with 4 rules applied. Total rules applied 1504 place count 158 transition count 347
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1530 place count 145 transition count 331
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1544 place count 145 transition count 317
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1545 place count 144 transition count 315
Iterating global reduction 8 with 1 rules applied. Total rules applied 1546 place count 144 transition count 315
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1580 place count 127 transition count 346
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1602 place count 127 transition count 324
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1611 place count 118 transition count 306
Iterating global reduction 9 with 9 rules applied. Total rules applied 1620 place count 118 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1626 place count 118 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 10 with 36 rules applied. Total rules applied 1662 place count 118 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1663 place count 117 transition count 263
Applied a total of 1663 rules in 93 ms. Remains 117 /1541 variables (removed 1424) and now considering 263/1970 (removed 1707) transitions.
[2025-05-30 09:34:46] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
// Phase 1: matrix 207 rows 117 cols
[2025-05-30 09:34:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:46] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 09:34:46] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
[2025-05-30 09:34:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 09:34:46] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [11, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 256 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 263/1970 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 261
Applied a total of 2 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2025-05-30 09:34:46] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
// Phase 1: matrix 205 rows 113 cols
[2025-05-30 09:34:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 09:34:46] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
[2025-05-30 09:34:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 09:34:46] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1541 places, 261/1970 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 113/1541 places, 261/1970 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-02 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0&&X((p0 U (p1||G(p0))))))) U ((p1&&X(X((p0&&X((p0 U (p1||G(p0))))))))||X(X(G((p0&&X((p0 U (p1||G(p0)))))))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1957
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1529 transition count 1956
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1520 transition count 1946
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1520 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1515 transition count 1941
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1515 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 1509 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1928
Applied a total of 73 rules in 540 ms. Remains 1506 /1541 variables (removed 35) and now considering 1928/1970 (removed 42) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:34:47] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:47] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 09:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:34:48] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:34: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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1541 places, 1928/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62049 ms. Remains : 1506/1541 places, 1928/1970 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Product exploration explored 100000 steps with 25000 reset in 247 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (313 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (87 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (92 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (96 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 295450 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 295450 steps, saw 81628 distinct states, run finished after 3006 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-30 09:35:53] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 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: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 3/1502 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1502 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1503 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1513 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4746 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9771ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 120 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 3 properties in 176 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLFireability-04 finished in 76330 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 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Graph (trivial) has 1880 edges and 1541 vertex of which 700 / 1541 are part of one of the 63 SCC in 2 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1402 edges and 904 vertex of which 894 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 893 transition count 730
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 516 rules applied. Total rules applied 1011 place count 401 transition count 706
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1023 place count 389 transition count 706
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1023 place count 389 transition count 659
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1117 place count 342 transition count 659
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1135 place count 324 transition count 630
Iterating global reduction 3 with 18 rules applied. Total rules applied 1153 place count 324 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 1158 place count 324 transition count 625
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1162 place count 320 transition count 625
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1172 place count 310 transition count 611
Iterating global reduction 5 with 10 rules applied. Total rules applied 1182 place count 310 transition count 611
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1189 place count 310 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1190 place count 309 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 1191 place count 309 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1192 place count 308 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 1193 place count 308 transition count 600
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1194 place count 307 transition count 598
Iterating global reduction 6 with 1 rules applied. Total rules applied 1195 place count 307 transition count 598
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1196 place count 306 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 1197 place count 306 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1198 place count 305 transition count 594
Iterating global reduction 6 with 1 rules applied. Total rules applied 1199 place count 305 transition count 594
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1200 place count 304 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 1201 place count 304 transition count 587
Performed 140 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 6 with 280 rules applied. Total rules applied 1481 place count 164 transition count 368
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1492 place count 164 transition count 357
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1496 place count 160 transition count 352
Iterating global reduction 7 with 4 rules applied. Total rules applied 1500 place count 160 transition count 352
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1526 place count 147 transition count 336
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1540 place count 147 transition count 322
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1541 place count 146 transition count 320
Iterating global reduction 8 with 1 rules applied. Total rules applied 1542 place count 146 transition count 320
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1580 place count 127 transition count 357
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1602 place count 127 transition count 335
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1611 place count 118 transition count 317
Iterating global reduction 9 with 9 rules applied. Total rules applied 1620 place count 118 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1626 place count 118 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1666 place count 118 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1667 place count 117 transition count 270
Applied a total of 1667 rules in 80 ms. Remains 117 /1541 variables (removed 1424) and now considering 270/1970 (removed 1700) transitions.
[2025-05-30 09:36:03] [INFO ] Flow matrix only has 212 transitions (discarded 58 similar events)
// Phase 1: matrix 212 rows 117 cols
[2025-05-30 09:36:03] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 09:36:03] [INFO ] Flow matrix only has 212 transitions (discarded 58 similar events)
[2025-05-30 09:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 09:36:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [13, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 270/1970 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 268
Applied a total of 2 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 268/270 (removed 2) transitions.
[2025-05-30 09:36:03] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
// Phase 1: matrix 210 rows 113 cols
[2025-05-30 09:36:03] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 09:36:03] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
[2025-05-30 09:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 09:36:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1541 places, 268/1970 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 404 ms. Remains : 113/1541 places, 268/1970 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-05 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1957
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1529 transition count 1956
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1520 transition count 1946
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1520 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1515 transition count 1941
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1515 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 1509 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1928
Applied a total of 73 rules in 565 ms. Remains 1506 /1541 variables (removed 35) and now considering 1928/1970 (removed 42) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:36:04] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:04] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-30 09:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:36:05] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:36:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1541 places, 1928/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62214 ms. Remains : 1506/1541 places, 1928/1970 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-06
Product exploration explored 100000 steps with 778 reset in 176 ms.
Product exploration explored 100000 steps with 766 reset in 187 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (316 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (91 resets) in 35 ms. (1111 steps per ms) remains 2/4 properties
[2025-05-30 09:37:06] [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) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4261 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3556 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7827ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 233 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1837 edges and 1506 vertex of which 690 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 627 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1309 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 870 transition count 638
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1043 place count 382 transition count 580
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 1083 place count 344 transition count 578
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1086 place count 342 transition count 577
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1086 place count 342 transition count 527
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1186 place count 292 transition count 527
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1197 place count 281 transition count 511
Iterating global reduction 4 with 11 rules applied. Total rules applied 1208 place count 281 transition count 511
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 3 rules applied. Total rules applied 1211 place count 281 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1214 place count 278 transition count 508
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1221 place count 271 transition count 500
Iterating global reduction 6 with 7 rules applied. Total rules applied 1228 place count 271 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1234 place count 271 transition count 494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1235 place count 270 transition count 488
Iterating global reduction 7 with 1 rules applied. Total rules applied 1236 place count 270 transition count 488
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1520 place count 128 transition count 250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1535 place count 128 transition count 235
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1537 place count 126 transition count 233
Iterating global reduction 8 with 2 rules applied. Total rules applied 1539 place count 126 transition count 233
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1563 place count 114 transition count 218
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1578 place count 114 transition count 203
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 9 with 2 rules applied. Total rules applied 1580 place count 113 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1582 place count 113 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1584 place count 112 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1585 place count 112 transition count 198
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1653 place count 78 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1700 place count 78 transition count 186
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1724 place count 54 transition count 151
Iterating global reduction 12 with 24 rules applied. Total rules applied 1748 place count 54 transition count 151
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1762 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1768 place count 48 transition count 125
Iterating global reduction 13 with 6 rules applied. Total rules applied 1774 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1780 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1800 place count 48 transition count 99
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1801 place count 47 transition count 96
Iterating global reduction 14 with 1 rules applied. Total rules applied 1802 place count 47 transition count 96
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1803 place count 46 transition count 95
Iterating global reduction 14 with 1 rules applied. Total rules applied 1804 place count 46 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1805 place count 46 transition count 94
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 15 with 2 rules applied. Total rules applied 1807 place count 45 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1808 place count 45 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1811 place count 45 transition count 89
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1815 place count 42 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1816 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1817 place count 41 transition count 87
Applied a total of 1817 rules in 59 ms. Remains 41 /1506 variables (removed 1465) and now considering 87/1928 (removed 1841) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 41/1506 places, 87/1928 transitions.
RANDOM walk for 24897 steps (606 resets) in 51 ms. (478 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 61 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-30 09:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:37:15] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-30 09:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:37:16] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (307 resets) in 119 ms. (333 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (105 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2025-05-30 09:38:17] [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) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4093 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3324 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7431ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1837 edges and 1506 vertex of which 690 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 627 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1309 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 870 transition count 638
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1043 place count 382 transition count 580
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 1083 place count 344 transition count 578
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1086 place count 342 transition count 577
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1086 place count 342 transition count 527
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1186 place count 292 transition count 527
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1197 place count 281 transition count 511
Iterating global reduction 4 with 11 rules applied. Total rules applied 1208 place count 281 transition count 511
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 3 rules applied. Total rules applied 1211 place count 281 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1214 place count 278 transition count 508
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1221 place count 271 transition count 500
Iterating global reduction 6 with 7 rules applied. Total rules applied 1228 place count 271 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1234 place count 271 transition count 494
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1235 place count 270 transition count 488
Iterating global reduction 7 with 1 rules applied. Total rules applied 1236 place count 270 transition count 488
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1520 place count 128 transition count 250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1535 place count 128 transition count 235
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1537 place count 126 transition count 233
Iterating global reduction 8 with 2 rules applied. Total rules applied 1539 place count 126 transition count 233
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1563 place count 114 transition count 218
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1578 place count 114 transition count 203
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 9 with 2 rules applied. Total rules applied 1580 place count 113 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1582 place count 113 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1584 place count 112 transition count 199
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1585 place count 112 transition count 198
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1653 place count 78 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1700 place count 78 transition count 186
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1724 place count 54 transition count 151
Iterating global reduction 12 with 24 rules applied. Total rules applied 1748 place count 54 transition count 151
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1762 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1768 place count 48 transition count 125
Iterating global reduction 13 with 6 rules applied. Total rules applied 1774 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1780 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1800 place count 48 transition count 99
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1801 place count 47 transition count 96
Iterating global reduction 14 with 1 rules applied. Total rules applied 1802 place count 47 transition count 96
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1803 place count 46 transition count 95
Iterating global reduction 14 with 1 rules applied. Total rules applied 1804 place count 46 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1805 place count 46 transition count 94
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 15 with 2 rules applied. Total rules applied 1807 place count 45 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1808 place count 45 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1811 place count 45 transition count 89
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1815 place count 42 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1816 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1817 place count 41 transition count 87
Applied a total of 1817 rules in 52 ms. Remains 41 /1506 variables (removed 1465) and now considering 87/1928 (removed 1841) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 41/1506 places, 87/1928 transitions.
RANDOM walk for 22422 steps (544 resets) in 29 ms. (747 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 764 reset in 158 ms.
Product exploration explored 100000 steps with 769 reset in 183 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1837 edges and 1506 vertex of which 690 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 627 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1372 edges and 879 vertex of which 870 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 870 transition count 1196
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 491 place count 870 transition count 1183
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 491 place count 870 transition count 1196
Deduced a syphon composed of 497 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 512 place count 870 transition count 1196
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 795 place count 587 transition count 904
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1078 place count 587 transition count 904
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1089 place count 576 transition count 890
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1100 place count 576 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1106 place count 576 transition count 884
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1116 place count 566 transition count 874
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 1126 place count 566 transition count 874
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1127 place count 565 transition count 872
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1128 place count 565 transition count 872
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1129 place count 564 transition count 870
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1130 place count 564 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1132 place count 562 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 562 transition count 868
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1135 place count 561 transition count 866
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1136 place count 561 transition count 866
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1137 place count 560 transition count 864
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1138 place count 560 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1140 place count 558 transition count 861
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1142 place count 558 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 556 transition count 853
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 556 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1148 place count 554 transition count 851
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1150 place count 554 transition count 851
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1258 place count 554 transition count 926
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1299 place count 554 transition count 885
Discarding 101 places :
Symmetric choice reduction at 4 with 101 rule applications. Total rules 1400 place count 453 transition count 774
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 101 rules applied. Total rules applied 1501 place count 453 transition count 774
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1507 place count 447 transition count 765
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1513 place count 447 transition count 765
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1520 place count 447 transition count 765
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1525 place count 447 transition count 760
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1540 place count 432 transition count 741
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1555 place count 432 transition count 741
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1561 place count 432 transition count 735
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1565 place count 428 transition count 731
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1569 place count 428 transition count 731
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1572 place count 428 transition count 731
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1578 place count 428 transition count 725
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1581 place count 425 transition count 722
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1584 place count 425 transition count 722
Performed 74 Post agglomeration using F-continuation condition with reduction of 123 identical transitions.
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 7 with 74 rules applied. Total rules applied 1658 place count 425 transition count 1059
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 7 with 124 rules applied. Total rules applied 1782 place count 425 transition count 935
Discarding 129 places :
Symmetric choice reduction at 8 with 129 rule applications. Total rules 1911 place count 296 transition count 592
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 8 with 129 rules applied. Total rules applied 2040 place count 296 transition count 592
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2055 place count 296 transition count 577
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2082 place count 269 transition count 520
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2109 place count 269 transition count 520
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2112 place count 269 transition count 568
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2115 place count 266 transition count 541
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2118 place count 266 transition count 541
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 9 with 53 rules applied. Total rules applied 2171 place count 266 transition count 488
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2175 place count 262 transition count 484
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2179 place count 262 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2182 place count 262 transition count 548
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2185 place count 259 transition count 533
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2188 place count 259 transition count 533
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2188 rules in 325 ms. Remains 259 /1506 variables (removed 1247) and now considering 533/1928 (removed 1395) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 09:38:26] [INFO ] Redundant transitions in 30 ms returned []
Running 532 sub problems to find dead transitions.
[2025-05-30 09:38:26] [INFO ] Flow matrix only has 474 transitions (discarded 59 similar events)
// Phase 1: matrix 474 rows 259 cols
[2025-05-30 09:38:26] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 09:38:26] [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/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 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 TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 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 TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
At refinement iteration 1 (OVERLAPS) 473/731 variables, 258/258 constraints. Problems are: Problem set: 250 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/731 variables, 3/261 constraints. Problems are: Problem set: 250 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/731 variables, 0/261 constraints. Problems are: Problem set: 250 solved, 282 unsolved
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/732 variables, 1/262 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 0/262 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 1/733 variables, 1/263 constraints. Problems are: Problem set: 255 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 263 constraints, problems are : Problem set: 255 solved, 277 unsolved in 30021 ms.
Refiners :[State Equation: 259/259 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 470/589 variables, 119/119 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 3/122 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 277/399 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/399 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 143/732 variables, 140/539 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/539 constraints. Problems are: Problem set: 255 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/733 variables, 1/540 constraints. Problems are: Problem set: 255 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 540 constraints, problems are : Problem set: 255 solved, 277 unsolved in 30026 ms.
Refiners :[State Equation: 259/259 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 277/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 255 solved, 277 unsolved
Search for dead transitions found 255 dead transitions in 60152ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 259/1506 places, 278/1928 transitions.
Graph (complete) has 424 edges and 259 vertex of which 120 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.0 ms
Discarding 139 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 113 transition count 260
Applied a total of 8 rules in 7 ms. Remains 113 /259 variables (removed 146) and now considering 260/278 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1506 places, 260/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60541 ms. Remains : 113/1506 places, 260/1928 transitions.
Built C files in :
/tmp/ltsmin1897870150157824446
[2025-05-30 09:39:27] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1897870150157824446
Running compilation step : cd /tmp/ltsmin1897870150157824446;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1897870150157824446;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1897870150157824446;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 58 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:39:30] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:39:30] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-05-30 09:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:39:31] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60461ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Finished structural reductions in LTL mode , in 1 iterations and 61598 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin6485311722731954063
[2025-05-30 09:40:31] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6485311722731954063
Running compilation step : cd /tmp/ltsmin6485311722731954063;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6485311722731954063;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6485311722731954063;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 09:40:35] [INFO ] Flatten gal took : 56 ms
[2025-05-30 09:40:35] [INFO ] Flatten gal took : 50 ms
[2025-05-30 09:40:35] [INFO ] Time to serialize gal into /tmp/LTL5112863448532229345.gal : 26 ms
[2025-05-30 09:40:35] [INFO ] Time to serialize properties into /tmp/LTL1794689422121045210.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/LTL5112863448532229345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12975922633149991145.hoa' '-atoms' '/tmp/LTL1794689422121045210.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/LTL1794689422121045210.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12975922633149991145.hoa
Detected timeout of ITS tools.
[2025-05-30 09:40:50] [INFO ] Flatten gal took : 43 ms
[2025-05-30 09:40:50] [INFO ] Flatten gal took : 41 ms
[2025-05-30 09:40:50] [INFO ] Time to serialize gal into /tmp/LTL10482199383084419438.gal : 8 ms
[2025-05-30 09:40:50] [INFO ] Time to serialize properties into /tmp/LTL9383306666840748590.ltl : 7 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/LTL10482199383084419438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9383306666840748590.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p654!=1)")||(G("(p339!=1)")))))))
Formula 0 simplified : XXF(!"(p654!=1)" & F!"(p339!=1)")
Detected timeout of ITS tools.
[2025-05-30 09:41:05] [INFO ] Flatten gal took : 35 ms
[2025-05-30 09:41:05] [INFO ] Applying decomposition
[2025-05-30 09:41:05] [INFO ] Flatten gal took : 35 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/graph7963493938600357908.txt' '-o' '/tmp/graph7963493938600357908.bin' '-w' '/tmp/graph7963493938600357908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7963493938600357908.bin' '-l' '-1' '-v' '-w' '/tmp/graph7963493938600357908.weights' '-q' '0' '-e' '0.001'
[2025-05-30 09:41:05] [INFO ] Decomposing Gal with order
[2025-05-30 09:41:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:41:05] [INFO ] Removed a total of 526 redundant transitions.
[2025-05-30 09:41:05] [INFO ] Flatten gal took : 128 ms
[2025-05-30 09:41:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 30 ms.
[2025-05-30 09:41:06] [INFO ] Time to serialize gal into /tmp/LTL846712154249401672.gal : 39 ms
[2025-05-30 09:41:06] [INFO ] Time to serialize properties into /tmp/LTL6951423740766055691.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/LTL846712154249401672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6951423740766055691.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i8.i0.i0.u138.p654!=1)")||(G("(i4.u67.p339!=1)")))))))
Formula 0 simplified : XXF(!"(i8.i0.i0.u138.p654!=1)" & F!"(i4.u67.p339!=1)")
Reverse transition relation is NOT exact ! Due to transitions t27, t261, t276, t280, t323, t374, t445, t699, t751, t765, t770, t813, t862, t984, t1137, t11...2115
Computing Next relation with stutter on 89440 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
623 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,6.42172,239224,1,0,401906,10272,22739,1.07216e+06,531,80539,1303702
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLFireability-06 finished in 310128 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)&&(G((p1||X(X(p2)))) U (p3&&G((p1||X(X(p2)))))))))'
Support contains 5 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1533 transition count 1962
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1533 transition count 1962
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 1533 transition count 1961
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 1527 transition count 1955
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 1527 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1525 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1525 transition count 1953
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 1525 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 1524 transition count 1951
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 1524 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 1523 transition count 1950
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 1523 transition count 1950
Applied a total of 38 rules in 291 ms. Remains 1523 /1541 variables (removed 18) and now considering 1950/1970 (removed 20) transitions.
// Phase 1: matrix 1950 rows 1523 cols
[2025-05-30 09:41:13] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:41:14] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-30 09:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:41:15] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2025-05-30 09:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1522 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1522/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1523 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1522 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1522/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1523 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1523/1541 places, 1950/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61927 ms. Remains : 1523/1541 places, 1950/1970 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-09 finished in 62284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&F(p1))) U (X(X(p2))||G(p3))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1530 transition count 1958
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1530 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1530 transition count 1957
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 1522 transition count 1948
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 1522 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 1518 transition count 1944
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 1518 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 1515 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 1515 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1932
Applied a total of 66 rules in 571 ms. Remains 1509 /1541 variables (removed 32) and now considering 1932/1970 (removed 38) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2025-05-30 09:42:16] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:42:16] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 09:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:42:17] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 09:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1541 places, 1932/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62137 ms. Remains : 1509/1541 places, 1932/1970 transitions.
Stuttering acceptance computed with spot in 557 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-11
Entered a terminal (fully accepting) state of product in 23003 steps with 172 reset in 31 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-11 finished in 62754 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(F(((X(p0)&&F(p1))||G(p0))))||(p2&&X(F(((X(p0)&&F(p1))||G(p0))))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1957
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1529 transition count 1956
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1520 transition count 1946
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1520 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1515 transition count 1941
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1515 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 1509 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1928
Applied a total of 73 rules in 564 ms. Remains 1506 /1541 variables (removed 35) and now considering 1928/1970 (removed 42) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:43:19] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:43:19] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 09:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:43:20] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:43:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1541 places, 1928/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62109 ms. Remains : 1506/1541 places, 1928/1970 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-13
Product exploration explored 100000 steps with 786 reset in 141 ms.
Product exploration explored 100000 steps with 766 reset in 160 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 144 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (297 resets) in 152 ms. (261 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (97 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (94 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (97 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (88 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2025-05-30 09:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 287/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 3 solved, 1 unsolved in 4274 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 289/290 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2060 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6341ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 159 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=159 )
Parikh walk visited 1 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p2 p0 p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 20 factoid took 297 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 60 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-30 09:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:44:29] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-30 09:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:44:29] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(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 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 0)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Finished structural reductions in LTL mode , in 1 iterations and 61548 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (301 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (95 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 366875 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 366875 steps, saw 93515 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2025-05-30 09:45: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) 288/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3953 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 288/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3414 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7374ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 665 / 1506 are part of one of the 61 SCC in 1 ms
Free SCC test removed 604 places
Drop transitions (Empty/Sink Transition effects.) removed 760 transitions
Reduce isomorphic transitions removed 760 transitions.
Graph (complete) has 1340 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 893 transition count 660
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 555 rules applied. Total rules applied 1061 place count 396 transition count 602
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 41 rules applied. Total rules applied 1102 place count 359 transition count 598
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 1108 place count 357 transition count 594
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 5 rules applied. Total rules applied 1113 place count 355 transition count 591
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1117 place count 353 transition count 589
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1121 place count 351 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1122 place count 350 transition count 587
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 53 Pre rules applied. Total rules applied 1122 place count 350 transition count 534
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 1228 place count 297 transition count 534
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1239 place count 286 transition count 518
Iterating global reduction 8 with 11 rules applied. Total rules applied 1250 place count 286 transition count 518
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 8 with 3 rules applied. Total rules applied 1253 place count 286 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1256 place count 283 transition count 515
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1263 place count 276 transition count 507
Iterating global reduction 10 with 7 rules applied. Total rules applied 1270 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1276 place count 276 transition count 501
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1277 place count 275 transition count 495
Iterating global reduction 11 with 1 rules applied. Total rules applied 1278 place count 275 transition count 495
Performed 144 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 11 with 288 rules applied. Total rules applied 1566 place count 131 transition count 255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1580 place count 131 transition count 241
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1583 place count 128 transition count 238
Iterating global reduction 12 with 3 rules applied. Total rules applied 1586 place count 128 transition count 238
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1612 place count 115 transition count 222
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1627 place count 115 transition count 207
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 13 with 2 rules applied. Total rules applied 1629 place count 114 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1631 place count 114 transition count 204
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 14 with 2 rules applied. Total rules applied 1633 place count 113 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1635 place count 113 transition count 201
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 15 with 70 rules applied. Total rules applied 1705 place count 78 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 15 with 50 rules applied. Total rules applied 1755 place count 78 transition count 183
Discarding 23 places :
Symmetric choice reduction at 16 with 23 rule applications. Total rules 1778 place count 55 transition count 153
Iterating global reduction 16 with 23 rules applied. Total rules applied 1801 place count 55 transition count 153
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 1815 place count 55 transition count 139
Discarding 6 places :
Symmetric choice reduction at 17 with 6 rule applications. Total rules 1821 place count 49 transition count 127
Iterating global reduction 17 with 6 rules applied. Total rules applied 1827 place count 49 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1833 place count 49 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 1853 place count 49 transition count 101
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1855 place count 47 transition count 95
Iterating global reduction 18 with 2 rules applied. Total rules applied 1857 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1859 place count 45 transition count 93
Iterating global reduction 18 with 2 rules applied. Total rules applied 1861 place count 45 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1863 place count 45 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1865 place count 45 transition count 89
Free-agglomeration rule applied 3 times.
Iterating global reduction 19 with 3 rules applied. Total rules applied 1868 place count 45 transition count 86
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 1872 place count 42 transition count 85
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 1875 place count 42 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1876 place count 42 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1877 place count 41 transition count 83
Applied a total of 1877 rules in 66 ms. Remains 41 /1506 variables (removed 1465) and now considering 83/1928 (removed 1845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 41/1506 places, 83/1928 transitions.
RANDOM walk for 180 steps (4 resets) in 5 ms. (30 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 790 reset in 133 ms.
Product exploration explored 100000 steps with 781 reset in 138 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 665 / 1506 are part of one of the 61 SCC in 1 ms
Free SCC test removed 604 places
Ensure Unique test removed 698 transitions
Reduce isomorphic transitions removed 698 transitions.
Graph (complete) has 1401 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 485 rules applied. Total rules applied 487 place count 893 transition count 1225
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 16 rules applied. Total rules applied 503 place count 893 transition count 1211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 4 rules applied. Total rules applied 507 place count 893 transition count 1209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 893 transition count 1207
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 509 place count 893 transition count 1221
Deduced a syphon composed of 512 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 532 place count 893 transition count 1221
Discarding 291 places :
Symmetric choice reduction at 4 with 291 rule applications. Total rules 823 place count 602 transition count 920
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 4 with 291 rules applied. Total rules applied 1114 place count 602 transition count 920
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1126 place count 590 transition count 904
Deduced a syphon composed of 235 places in 1 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 1138 place count 590 transition count 904
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1144 place count 590 transition count 898
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1156 place count 578 transition count 886
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 12 rules applied. Total rules applied 1168 place count 578 transition count 886
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1169 place count 577 transition count 884
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1170 place count 577 transition count 884
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1171 place count 576 transition count 882
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1172 place count 576 transition count 882
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1174 place count 574 transition count 880
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1176 place count 574 transition count 880
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1177 place count 573 transition count 878
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1178 place count 573 transition count 878
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1179 place count 572 transition count 876
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1180 place count 572 transition count 876
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1182 place count 570 transition count 873
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1184 place count 570 transition count 873
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1186 place count 568 transition count 865
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1188 place count 568 transition count 865
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1190 place count 566 transition count 863
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1192 place count 566 transition count 863
Performed 113 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 334 places in 0 ms
Iterating global reduction 5 with 113 rules applied. Total rules applied 1305 place count 566 transition count 938
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 1348 place count 566 transition count 895
Discarding 110 places :
Symmetric choice reduction at 6 with 110 rule applications. Total rules 1458 place count 456 transition count 775
Deduced a syphon composed of 234 places in 1 ms
Iterating global reduction 6 with 110 rules applied. Total rules applied 1568 place count 456 transition count 775
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1574 place count 450 transition count 766
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1580 place count 450 transition count 766
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 1588 place count 450 transition count 766
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1593 place count 450 transition count 761
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1610 place count 433 transition count 740
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 1627 place count 433 transition count 740
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1633 place count 433 transition count 734
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1637 place count 429 transition count 730
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1641 place count 429 transition count 730
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1644 place count 429 transition count 730
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1650 place count 429 transition count 724
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1653 place count 426 transition count 721
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1656 place count 426 transition count 721
Performed 74 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 293 places in 0 ms
Iterating global reduction 9 with 74 rules applied. Total rules applied 1730 place count 426 transition count 1066
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 9 with 128 rules applied. Total rules applied 1858 place count 426 transition count 938
Discarding 132 places :
Symmetric choice reduction at 10 with 132 rule applications. Total rules 1990 place count 294 transition count 582
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 10 with 132 rules applied. Total rules applied 2122 place count 294 transition count 582
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2137 place count 294 transition count 567
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 2164 place count 267 transition count 510
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 11 with 27 rules applied. Total rules applied 2191 place count 267 transition count 510
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2194 place count 267 transition count 558
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2197 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2200 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 11 with 50 rules applied. Total rules applied 2250 place count 264 transition count 481
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2254 place count 260 transition count 477
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2258 place count 260 transition count 477
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2261 place count 260 transition count 537
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2264 place count 257 transition count 522
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2267 place count 257 transition count 522
Deduced a syphon composed of 139 places in 1 ms
Applied a total of 2267 rules in 205 ms. Remains 257 /1506 variables (removed 1249) and now considering 522/1928 (removed 1406) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 09:45:42] [INFO ] Redundant transitions in 9 ms returned []
Running 521 sub problems to find dead transitions.
[2025-05-30 09:45:42] [INFO ] Flow matrix only has 466 transitions (discarded 56 similar events)
// Phase 1: matrix 466 rows 257 cols
[2025-05-30 09:45:42] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 09:45:42] [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/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 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 TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 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 TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
At refinement iteration 1 (OVERLAPS) 465/721 variables, 256/256 constraints. Problems are: Problem set: 249 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/721 variables, 3/259 constraints. Problems are: Problem set: 249 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/721 variables, 0/259 constraints. Problems are: Problem set: 249 solved, 272 unsolved
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/722 variables, 1/260 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 0/260 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/723 variables, 1/261 constraints. Problems are: Problem set: 254 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 723/723 variables, and 261 constraints, problems are : Problem set: 254 solved, 267 unsolved in 30014 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 254 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 462/579 variables, 117/117 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 3/120 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 267/387 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/387 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 143/722 variables, 140/527 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 0/527 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/723 variables, 1/528 constraints. Problems are: Problem set: 254 solved, 267 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 723/723 variables, and 528 constraints, problems are : Problem set: 254 solved, 267 unsolved in 30012 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 267/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 254 solved, 267 unsolved
Search for dead transitions found 254 dead transitions in 60131ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1506 places, 268/1928 transitions.
Graph (complete) has 411 edges and 257 vertex of which 118 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.0 ms
Discarding 139 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 111 transition count 250
Applied a total of 8 rules in 5 ms. Remains 111 /257 variables (removed 146) and now considering 250/268 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1506 places, 250/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60355 ms. Remains : 111/1506 places, 250/1928 transitions.
Built C files in :
/tmp/ltsmin4113961515270667776
[2025-05-30 09:46:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4113961515270667776
Running compilation step : cd /tmp/ltsmin4113961515270667776;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4113961515270667776;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4113961515270667776;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 60 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:46:45] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:46:45] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 09:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:46:46] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in LTL mode , in 1 iterations and 61573 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin17304378096023557289
[2025-05-30 09:47:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17304378096023557289
Running compilation step : cd /tmp/ltsmin17304378096023557289;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17304378096023557289;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17304378096023557289;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 09:47:50] [INFO ] Flatten gal took : 32 ms
[2025-05-30 09:47:50] [INFO ] Flatten gal took : 33 ms
[2025-05-30 09:47:50] [INFO ] Time to serialize gal into /tmp/LTL12493947500442993576.gal : 6 ms
[2025-05-30 09:47:50] [INFO ] Time to serialize properties into /tmp/LTL9669101471891020026.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/LTL12493947500442993576.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8869151067825853618.hoa' '-atoms' '/tmp/LTL9669101471891020026.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/LTL9669101471891020026.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8869151067825853618.hoa
Detected timeout of ITS tools.
[2025-05-30 09:48:05] [INFO ] Flatten gal took : 29 ms
[2025-05-30 09:48:05] [INFO ] Flatten gal took : 28 ms
[2025-05-30 09:48:05] [INFO ] Time to serialize gal into /tmp/LTL2204133646464156275.gal : 5 ms
[2025-05-30 09:48:05] [INFO ] Time to serialize properties into /tmp/LTL16908786911467233090.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/LTL2204133646464156275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16908786911467233090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(p303!=1)"))||((X("(p303!=1)"))&&(F("(p355!=1)"))))))||(("(p359==1)")&&(X(F((G("(p303!=1)"))||((X("(p303!=1)"))&&(F("(p3...172
Formula 0 simplified : G(F!"(p303!=1)" & (!"(p359==1)" | XG(F!"(p303!=1)" & (X!"(p303!=1)" | G!"(p355!=1)"))) & F(G!"(p355!=1)" | G!"(p303!=1)"))
Detected timeout of ITS tools.
[2025-05-30 09:48:20] [INFO ] Flatten gal took : 31 ms
[2025-05-30 09:48:20] [INFO ] Applying decomposition
[2025-05-30 09:48:20] [INFO ] Flatten gal took : 28 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/graph3106055200947159113.txt' '-o' '/tmp/graph3106055200947159113.bin' '-w' '/tmp/graph3106055200947159113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3106055200947159113.bin' '-l' '-1' '-v' '-w' '/tmp/graph3106055200947159113.weights' '-q' '0' '-e' '0.001'
[2025-05-30 09:48:20] [INFO ] Decomposing Gal with order
[2025-05-30 09:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:48:20] [INFO ] Removed a total of 501 redundant transitions.
[2025-05-30 09:48:20] [INFO ] Flatten gal took : 73 ms
[2025-05-30 09:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 32 ms.
[2025-05-30 09:48:20] [INFO ] Time to serialize gal into /tmp/LTL15232628911885984208.gal : 14 ms
[2025-05-30 09:48:20] [INFO ] Time to serialize properties into /tmp/LTL8149427282110500894.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/LTL15232628911885984208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8149427282110500894.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(i5.u57.p303!=1)"))||((X("(i5.u57.p303!=1)"))&&(F("(i4.i0.i1.u67.p355!=1)"))))))||(("(i4.i1.i1.u62.p359==1)")&&(X(F((G("...239
Formula 0 simplified : G(F!"(i5.u57.p303!=1)" & (!"(i4.i1.i1.u62.p359==1)" | XG(F!"(i5.u57.p303!=1)" & (X!"(i5.u57.p303!=1)" | G!"(i4.i0.i1.u67.p355!=1)"))...212
Reverse transition relation is NOT exact ! Due to transitions t27, t180, t261, t292, t323, t374, t445, t699, t751, t784, t813, t862, t984, t1137, t1218, t1...2049
Computing Next relation with stutter on 89440 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
674 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,6.92442,250920,1,0,417264,12398,22156,878130,564,102360,1771070
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLFireability-13 finished in 310252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&F(!p1)) U X(X(!p1))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1970/1970 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1529 transition count 1957
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1529 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1529 transition count 1956
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1520 transition count 1946
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1520 transition count 1946
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1515 transition count 1941
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1515 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1512 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 1509 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1507 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1506 transition count 1928
Applied a total of 73 rules in 552 ms. Remains 1506 /1541 variables (removed 35) and now considering 1928/1970 (removed 42) transitions.
[2025-05-30 09:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:48:29] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-30 09:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:48:30] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:48:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1541 places, 1928/1970 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62025 ms. Remains : 1506/1541 places, 1928/1970 transitions.
Stuttering acceptance computed with spot in 319 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-14
Product exploration explored 100000 steps with 19962 reset in 212 ms.
Product exploration explored 100000 steps with 19987 reset in 218 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
RANDOM walk for 40000 steps (307 resets) in 106 ms. (373 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
[2025-05-30 09:49:32] [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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4096 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3500 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7603ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 110 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=36 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 286 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 59 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2025-05-30 09:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:49:41] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-30 09:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:49:41] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Finished structural reductions in LTL mode , in 1 iterations and 61589 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
RANDOM walk for 40000 steps (324 resets) in 93 ms. (425 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2025-05-30 09:50:42] [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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3959 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3483 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7451ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 119 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 310 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Stuttering acceptance computed with spot in 278 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Product exploration explored 100000 steps with 20007 reset in 199 ms.
Product exploration explored 100000 steps with 20024 reset in 204 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, false, false]
Stuttering acceptance computed with spot in 303 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1367 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 487 place count 867 transition count 1179
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 487 place count 867 transition count 1192
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 509 place count 867 transition count 1192
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 584 transition count 899
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 584 transition count 899
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 572 transition count 883
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 572 transition count 883
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 572 transition count 877
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 560 transition count 865
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 560 transition count 865
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 558 transition count 861
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 558 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 556 transition count 857
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 556 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 552 transition count 853
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 552 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 550 transition count 849
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 550 transition count 849
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 548 transition count 845
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 548 transition count 845
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 544 transition count 839
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 544 transition count 839
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 540 transition count 823
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 540 transition count 823
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 540 transition count 823
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 536 transition count 819
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 536 transition count 819
Performed 103 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 312 places in 1 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1281 place count 536 transition count 893
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1320 place count 536 transition count 854
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1418 place count 438 transition count 746
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 98 rules applied. Total rules applied 1516 place count 438 transition count 746
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1522 place count 432 transition count 737
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1528 place count 432 transition count 737
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1535 place count 432 transition count 737
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1539 place count 432 transition count 733
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1554 place count 417 transition count 714
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1569 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1575 place count 417 transition count 708
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1579 place count 413 transition count 704
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1583 place count 413 transition count 704
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1586 place count 413 transition count 704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1592 place count 413 transition count 698
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1595 place count 410 transition count 695
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1598 place count 410 transition count 695
Performed 69 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 279 places in 0 ms
Iterating global reduction 8 with 69 rules applied. Total rules applied 1667 place count 410 transition count 1006
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 8 with 120 rules applied. Total rules applied 1787 place count 410 transition count 886
Discarding 122 places :
Symmetric choice reduction at 9 with 122 rule applications. Total rules 1909 place count 288 transition count 565
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 9 with 122 rules applied. Total rules applied 2031 place count 288 transition count 565
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 2043 place count 288 transition count 553
Discarding 22 places :
Symmetric choice reduction at 10 with 22 rule applications. Total rules 2065 place count 266 transition count 509
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 22 rules applied. Total rules applied 2087 place count 266 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2090 place count 266 transition count 559
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2093 place count 263 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2096 place count 263 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2142 place count 263 transition count 485
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2146 place count 259 transition count 480
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2150 place count 259 transition count 480
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2152 place count 259 transition count 520
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2154 place count 257 transition count 510
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2156 place count 257 transition count 510
Deduced a syphon composed of 139 places in 1 ms
Applied a total of 2156 rules in 206 ms. Remains 257 /1506 variables (removed 1249) and now considering 510/1928 (removed 1418) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 09:50:52] [INFO ] Redundant transitions in 4 ms returned []
Running 509 sub problems to find dead transitions.
[2025-05-30 09:50:52] [INFO ] Flow matrix only has 454 transitions (discarded 56 similar events)
// Phase 1: matrix 454 rows 257 cols
[2025-05-30 09:50:52] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 09:50:52] [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/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 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 TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 1 (OVERLAPS) 453/709 variables, 256/256 constraints. Problems are: Problem set: 247 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 2/258 constraints. Problems are: Problem set: 247 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 0/258 constraints. Problems are: Problem set: 247 solved, 262 unsolved
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/710 variables, 1/259 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/710 variables, 0/259 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 1/711 variables, 1/260 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 0/260 constraints. Problems are: Problem set: 252 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/711 variables, and 260 constraints, problems are : Problem set: 252 solved, 257 unsolved in 30013 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 252 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 450/567 variables, 117/117 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/119 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 257/376 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/376 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 143/710 variables, 140/516 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/516 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/711 variables, 1/517 constraints. Problems are: Problem set: 252 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/711 variables, and 517 constraints, problems are : Problem set: 252 solved, 257 unsolved in 30018 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 257/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 252 solved, 257 unsolved
Search for dead transitions found 252 dead transitions in 60114ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1506 places, 258/1928 transitions.
Graph (complete) has 400 edges and 257 vertex of which 118 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.1 ms
Discarding 139 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 111 transition count 240
Applied a total of 8 rules in 4 ms. Remains 111 /257 variables (removed 146) and now considering 240/258 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1506 places, 240/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60338 ms. Remains : 111/1506 places, 240/1928 transitions.
Built C files in :
/tmp/ltsmin9430091015952411272
[2025-05-30 09:51:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9430091015952411272
Running compilation step : cd /tmp/ltsmin9430091015952411272;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9430091015952411272;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9430091015952411272;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 57 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 09:51:55] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:51:55] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 09:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:51:56] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 09:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in LTL mode , in 1 iterations and 61526 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin8262580462475340203
[2025-05-30 09:52:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8262580462475340203
Running compilation step : cd /tmp/ltsmin8262580462475340203;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8262580462475340203;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8262580462475340203;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 09:53:00] [INFO ] Flatten gal took : 28 ms
[2025-05-30 09:53:00] [INFO ] Flatten gal took : 27 ms
[2025-05-30 09:53:00] [INFO ] Time to serialize gal into /tmp/LTL12781753661417288346.gal : 5 ms
[2025-05-30 09:53:00] [INFO ] Time to serialize properties into /tmp/LTL1191470851672852467.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/LTL12781753661417288346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11532842947474397808.hoa' '-atoms' '/tmp/LTL1191470851672852467.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...319
Loading property file /tmp/LTL1191470851672852467.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11532842947474397808.hoa
Detected timeout of ITS tools.
[2025-05-30 09:53:15] [INFO ] Flatten gal took : 26 ms
[2025-05-30 09:53:15] [INFO ] Flatten gal took : 27 ms
[2025-05-30 09:53:15] [INFO ] Time to serialize gal into /tmp/LTL6194876836290827707.gal : 5 ms
[2025-05-30 09:53:15] [INFO ] Time to serialize properties into /tmp/LTL3926529447012085857.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/LTL6194876836290827707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3926529447012085857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((("(p2459==1)")&&(F("(p707!=1)")))U(X(X("(p707!=1)")))))))
Formula 0 simplified : XF((!"(p2459==1)" | G!"(p707!=1)") R XX!"(p707!=1)")
Detected timeout of ITS tools.
[2025-05-30 09:53:30] [INFO ] Flatten gal took : 28 ms
[2025-05-30 09:53:30] [INFO ] Applying decomposition
[2025-05-30 09:53:30] [INFO ] Flatten gal took : 26 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/graph7477995126001278367.txt' '-o' '/tmp/graph7477995126001278367.bin' '-w' '/tmp/graph7477995126001278367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7477995126001278367.bin' '-l' '-1' '-v' '-w' '/tmp/graph7477995126001278367.weights' '-q' '0' '-e' '0.001'
[2025-05-30 09:53:30] [INFO ] Decomposing Gal with order
[2025-05-30 09:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:53:30] [INFO ] Removed a total of 499 redundant transitions.
[2025-05-30 09:53:30] [INFO ] Flatten gal took : 57 ms
[2025-05-30 09:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 12 ms.
[2025-05-30 09:53:30] [INFO ] Time to serialize gal into /tmp/LTL2283242035340732860.gal : 13 ms
[2025-05-30 09:53:30] [INFO ] Time to serialize properties into /tmp/LTL10043385716408937731.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/LTL2283242035340732860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10043385716408937731.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((("(i38.i1.i0.u581.p2459==1)")&&(F("(i11.i1.i0.u148.p707!=1)")))U(X(X("(i11.i1.i0.u148.p707!=1)")))))))
Formula 0 simplified : XF((!"(i38.i1.i0.u581.p2459==1)" | G!"(i11.i1.i0.u148.p707!=1)") R XX!"(i11.i1.i0.u148.p707!=1)")
Reverse transition relation is NOT exact ! Due to transitions t27, t209, t261, t292, t323, t445, t670, t751, t784, t862, t984, t1166, t1218, t1249, t1327, ...2063
Computing Next relation with stutter on 89440 deadlock states
41 unique states visited
41 strongly connected components in search stack
42 transitions explored
41 items max in DFS search stack
794 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,8.11222,284768,1,0,511093,5376,22127,997823,669,24526,2029251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLFireability-14 finished in 311126 ms.
All properties solved by simple procedures.
Total runtime 1276909 ms.
BK_STOP 1748598820115
--------------------
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="CloudReconfiguration-PT-316"
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 CloudReconfiguration-PT-316, 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-174854028200324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 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 '
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 ;