Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624188800187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-310, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188800187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-310-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717181236853

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-310
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:47:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:47:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:47:18] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-31 18:47:18] [INFO ] Transformed 2585 places.
[2024-05-31 18:47:18] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:47:18] [INFO ] Found NUPN structural information;
[2024-05-31 18:47:18] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2066 transition count 2547
Discarding 242 places :
Symmetric choice reduction at 1 with 242 rule applications. Total rules 1309 place count 1824 transition count 2305
Iterating global reduction 1 with 242 rules applied. Total rules applied 1551 place count 1824 transition count 2305
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 1642 place count 1733 transition count 2214
Iterating global reduction 1 with 91 rules applied. Total rules applied 1733 place count 1733 transition count 2214
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1750 place count 1733 transition count 2197
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1800 place count 1683 transition count 2147
Iterating global reduction 2 with 50 rules applied. Total rules applied 1850 place count 1683 transition count 2147
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1859 place count 1683 transition count 2138
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1899 place count 1643 transition count 2093
Iterating global reduction 3 with 40 rules applied. Total rules applied 1939 place count 1643 transition count 2093
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1968 place count 1614 transition count 2064
Iterating global reduction 3 with 29 rules applied. Total rules applied 1997 place count 1614 transition count 2064
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2023 place count 1588 transition count 2038
Iterating global reduction 3 with 26 rules applied. Total rules applied 2049 place count 1588 transition count 2038
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2075 place count 1562 transition count 2012
Iterating global reduction 3 with 26 rules applied. Total rules applied 2101 place count 1562 transition count 2012
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2124 place count 1539 transition count 1975
Iterating global reduction 3 with 23 rules applied. Total rules applied 2147 place count 1539 transition count 1975
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2155 place count 1531 transition count 1962
Iterating global reduction 3 with 8 rules applied. Total rules applied 2163 place count 1531 transition count 1962
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2171 place count 1523 transition count 1951
Iterating global reduction 3 with 8 rules applied. Total rules applied 2179 place count 1523 transition count 1951
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2181 place count 1523 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2184 place count 1520 transition count 1946
Iterating global reduction 4 with 3 rules applied. Total rules applied 2187 place count 1520 transition count 1946
Applied a total of 2187 rules in 1345 ms. Remains 1520 /2585 variables (removed 1065) and now considering 1946/3095 (removed 1149) transitions.
// Phase 1: matrix 1946 rows 1520 cols
[2024-05-31 18:47:20] [INFO ] Computed 4 invariants in 35 ms
[2024-05-31 18:47:20] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-31 18:47:20] [INFO ] Invariant cache hit.
[2024-05-31 18:47:21] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1693 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2024-05-31 18:47:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/3466 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30069 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1945/1945 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/3466 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 0/1945 constraints, Known Traps: 0/0 constraints]
After SMT, in 60752ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Starting structural reductions in LTL mode, iteration 1 : 1520/2585 places, 1946/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63899 ms. Remains : 1520/2585 places, 1946/3095 transitions.
Support contains 19 out of 1520 places after structural reductions.
[2024-05-31 18:48:22] [INFO ] Flatten gal took : 140 ms
[2024-05-31 18:48:23] [INFO ] Flatten gal took : 72 ms
[2024-05-31 18:48:23] [INFO ] Input system was already deterministic with 1946 transitions.
RANDOM walk for 40000 steps (312 resets) in 1744 ms. (22 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (98 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (96 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (86 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (88 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (96 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (100 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (97 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
[2024-05-31 18:48:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1509 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3445 variables, 1509/1513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3445 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/3447 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3447 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/3449 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3449 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/3451 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3451 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/3453 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3453 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/3455 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3455 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/3457 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3457 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/3459 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3459 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 2/3463 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3463 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 2/3465 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3465 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/3466 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3466/3466 variables, and 1524 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4619 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1509 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3445 variables, 1509/1513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3445 variables, 7/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3445 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/3447 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3447 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/3449 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3449 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/3451 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3451 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/3453 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3453 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/3455 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3455 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/3457 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3457 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/3459 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3459 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 2/3461 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3461 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 2/3463 variables, 1/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3463 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 2/3465 variables, 1/1530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3465 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 1/3466 variables, 1/1531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3466 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3466/3466 variables, and 1531 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1520/1520 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 9661ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 1520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Graph (trivial) has 1834 edges and 1520 vertex of which 666 / 1520 are part of one of the 62 SCC in 8 ms
Free SCC test removed 604 places
Drop transitions (Empty/Sink Transition effects.) removed 764 transitions
Reduce isomorphic transitions removed 764 transitions.
Graph (complete) has 1354 edges and 916 vertex of which 907 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 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 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 907 transition count 684
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 541 rules applied. Total rules applied 1037 place count 420 transition count 630
Reduce places removed 35 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 41 rules applied. Total rules applied 1078 place count 385 transition count 624
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1084 place count 379 transition count 624
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1084 place count 379 transition count 574
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 1184 place count 329 transition count 574
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1196 place count 317 transition count 558
Iterating global reduction 4 with 12 rules applied. Total rules applied 1208 place count 317 transition count 558
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 317 transition count 555
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1214 place count 314 transition count 555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1214 place count 314 transition count 554
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1216 place count 313 transition count 554
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1222 place count 307 transition count 548
Iterating global reduction 6 with 6 rules applied. Total rules applied 1228 place count 307 transition count 548
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 307 transition count 542
Performed 154 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 7 with 308 rules applied. Total rules applied 1542 place count 153 transition count 292
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1561 place count 153 transition count 273
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1564 place count 150 transition count 270
Iterating global reduction 8 with 3 rules applied. Total rules applied 1567 place count 150 transition count 270
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 8 with 26 rules applied. Total rules applied 1593 place count 137 transition count 254
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1609 place count 137 transition count 238
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 1611 place count 136 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1613 place count 136 transition count 235
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 1615 place count 135 transition count 234
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 1616 place count 135 transition count 233
Performed 35 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 1686 place count 100 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 11 with 34 rules applied. Total rules applied 1720 place count 100 transition count 226
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 1740 place count 80 transition count 194
Iterating global reduction 12 with 20 rules applied. Total rules applied 1760 place count 80 transition count 194
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1769 place count 80 transition count 185
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1772 place count 77 transition count 179
Iterating global reduction 13 with 3 rules applied. Total rules applied 1775 place count 77 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1778 place count 77 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1786 place count 77 transition count 168
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1787 place count 76 transition count 167
Iterating global reduction 14 with 1 rules applied. Total rules applied 1788 place count 76 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1789 place count 76 transition count 166
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1793 place count 76 transition count 162
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1799 place count 72 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1800 place count 72 transition count 159
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1802 place count 72 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1803 place count 71 transition count 158
Applied a total of 1803 rules in 232 ms. Remains 71 /1520 variables (removed 1449) and now considering 158/1946 (removed 1788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 71/1520 places, 158/1946 transitions.
RANDOM walk for 40000 steps (531 resets) in 562 ms. (71 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (165 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-05-31 18:48:34] [INFO ] Flow matrix only has 149 transitions (discarded 9 similar events)
// Phase 1: matrix 149 rows 71 cols
[2024-05-31 18:48:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-31 18:48:34] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/60 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:48:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 102/162 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/196 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 220/220 variables, and 77 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 1/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2123 edges and 1520 vertex of which 1511 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((!((p0 U p1) U p0) U (X(p1)&&X(p0)))))))'
Support contains 4 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1514 transition count 1940
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1514 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 1510 transition count 1935
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1509 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 1507 transition count 1929
Applied a total of 28 rules in 301 ms. Remains 1507 /1520 variables (removed 13) and now considering 1929/1946 (removed 17) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:48:34] [INFO ] Computed 4 invariants in 18 ms
[2024-05-31 18:48:35] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-31 18:48:35] [INFO ] Invariant cache hit.
[2024-05-31 18:48:36] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:48:36] [INFO ] Invariant cache hit.
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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 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 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60656ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1520 places, 1929/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62215 ms. Remains : 1507/1520 places, 1929/1946 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLCardinality-00
Product exploration explored 100000 steps with 801 reset in 271 ms.
Product exploration explored 100000 steps with 782 reset in 222 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (315 resets) in 299 ms. (133 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (96 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
[2024-05-31 18:49:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 803/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1343 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 691/693 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 803/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1538 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 140 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 55 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
[2024-05-31 18:49:41] [INFO ] Invariant cache hit.
[2024-05-31 18:49:41] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 18:49:41] [INFO ] Invariant cache hit.
[2024-05-31 18:49:42] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:49:43] [INFO ] Invariant cache hit.
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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Finished structural reductions in LTL mode , in 1 iterations and 61880 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (308 resets) in 366 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (96 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (100 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 308858 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 3
Probabilistic random walk after 308858 steps, saw 85436 distinct states, run finished after 3005 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-31 18:50:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1091/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2446 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1091/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1514 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2666 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5120ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3770 steps, including 63 resets, run visited all 1 properties in 17 ms. (steps per millisecond=221 )
Parikh walk visited 3 properties in 88 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 784 reset in 166 ms.
Product exploration explored 100000 steps with 801 reset in 181 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1834 edges and 1507 vertex of which 689 / 1507 are part of one of the 63 SCC in 5 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1373 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 472 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 872 transition count 1197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 486 place count 872 transition count 1185
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 486 place count 872 transition count 1198
Deduced a syphon composed of 493 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 507 place count 872 transition count 1198
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 784 place count 595 transition count 912
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 2 with 277 rules applied. Total rules applied 1061 place count 595 transition count 912
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1072 place count 584 transition count 898
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1083 place count 584 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1089 place count 584 transition count 892
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1100 place count 573 transition count 881
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1111 place count 573 transition count 881
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1113 place count 571 transition count 877
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1115 place count 571 transition count 877
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1117 place count 569 transition count 873
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 569 transition count 873
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1123 place count 565 transition count 869
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1127 place count 565 transition count 869
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1129 place count 563 transition count 865
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 563 transition count 865
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1132 place count 562 transition count 863
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1133 place count 562 transition count 863
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1134 place count 561 transition count 862
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1135 place count 561 transition count 862
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 325 places in 1 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1243 place count 561 transition count 937
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1286 place count 561 transition count 894
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 1389 place count 458 transition count 781
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1492 place count 458 transition count 781
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1498 place count 452 transition count 772
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1504 place count 452 transition count 772
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1511 place count 452 transition count 772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1517 place count 452 transition count 766
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1532 place count 437 transition count 747
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1547 place count 437 transition count 747
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1553 place count 437 transition count 741
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1557 place count 433 transition count 737
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1561 place count 433 transition count 737
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1564 place count 433 transition count 737
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1570 place count 433 transition count 731
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1573 place count 430 transition count 728
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1576 place count 430 transition count 728
Performed 73 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 7 with 73 rules applied. Total rules applied 1649 place count 430 transition count 1058
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 7 with 125 rules applied. Total rules applied 1774 place count 430 transition count 933
Discarding 127 places :
Symmetric choice reduction at 8 with 127 rule applications. Total rules 1901 place count 303 transition count 599
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 8 with 127 rules applied. Total rules applied 2028 place count 303 transition count 599
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2040 place count 303 transition count 587
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 2064 place count 279 transition count 540
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 24 rules applied. Total rules applied 2088 place count 279 transition count 540
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2091 place count 279 transition count 590
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2094 place count 276 transition count 562
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2097 place count 276 transition count 562
Deduced a syphon composed of 149 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 2150 place count 276 transition count 509
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2155 place count 271 transition count 504
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2160 place count 271 transition count 504
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2163 place count 271 transition count 564
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2166 place count 268 transition count 549
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2169 place count 268 transition count 549
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 2169 rules in 372 ms. Remains 268 /1507 variables (removed 1239) and now considering 549/1929 (removed 1380) transitions.
[2024-05-31 18:50:54] [INFO ] Redundant transitions in 30 ms returned []
Running 548 sub problems to find dead transitions.
[2024-05-31 18:50:54] [INFO ] Flow matrix only has 493 transitions (discarded 56 similar events)
// Phase 1: matrix 493 rows 268 cols
[2024-05-31 18:50:54] [INFO ] Computed 0 invariants in 4 ms
[2024-05-31 18:50:54] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 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 TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem 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 TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 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 TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 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 TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 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 TDEAD422 is UNSAT
Problem TDEAD423 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 TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 1 (OVERLAPS) 492/759 variables, 267/267 constraints. Problems are: Problem set: 265 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/759 variables, 4/271 constraints. Problems are: Problem set: 265 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/759 variables, 0/271 constraints. Problems are: Problem set: 265 solved, 283 unsolved
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/760 variables, 1/272 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 0/272 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 1/761 variables, 1/273 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/273 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 0/761 variables, 0/273 constraints. Problems are: Problem set: 270 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 273 constraints, problems are : Problem set: 270 solved, 278 unsolved in 21627 ms.
Refiners :[State Equation: 268/268 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 270 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 489/612 variables, 123/123 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 4/127 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 278/405 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/405 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 148/760 variables, 145/550 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/550 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/761 variables, 1/551 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/551 constraints. Problems are: Problem set: 270 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/761 variables, 0/551 constraints. Problems are: Problem set: 270 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 761/761 variables, and 551 constraints, problems are : Problem set: 270 solved, 278 unsolved in 24894 ms.
Refiners :[State Equation: 268/268 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 278/548 constraints, Known Traps: 0/0 constraints]
After SMT, in 46774ms problems are : Problem set: 270 solved, 278 unsolved
Search for dead transitions found 270 dead transitions in 46780ms
Found 270 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 270 transitions
Dead transitions reduction (with SMT) removed 270 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 268/1507 places, 279/1929 transitions.
Graph (complete) has 423 edges and 268 vertex of which 124 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.2 ms
Discarding 144 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 117 transition count 261
Applied a total of 8 rules in 16 ms. Remains 117 /268 variables (removed 151) and now considering 261/279 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1507 places, 261/1929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47210 ms. Remains : 117/1507 places, 261/1929 transitions.
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 48 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:51:41] [INFO ] Computed 4 invariants in 11 ms
[2024-05-31 18:51:41] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-31 18:51:41] [INFO ] Invariant cache hit.
[2024-05-31 18:51:42] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:51:42] [INFO ] Invariant cache hit.
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 0.0)
(s15 1.0)
(s16 1.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 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 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 0.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 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60587ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Treatment of property CloudReconfiguration-PT-310-LTLCardinality-00 finished in 248394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(p1)))&&p0))))'
Support contains 4 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1514 transition count 1940
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1514 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 1510 transition count 1935
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1509 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 1507 transition count 1929
Applied a total of 28 rules in 321 ms. Remains 1507 /1520 variables (removed 13) and now considering 1929/1946 (removed 17) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:52:43] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:52:43] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-31 18:52:43] [INFO ] Invariant cache hit.
[2024-05-31 18:52:44] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:52:44] [INFO ] Invariant cache hit.
(s228 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 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 0.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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1520 places, 1929/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62113 ms. Remains : 1507/1520 places, 1929/1946 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLCardinality-10
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLCardinality-10 finished in 62487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1520 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Graph (trivial) has 1856 edges and 1520 vertex of which 697 / 1520 are part of one of the 63 SCC in 4 ms
Free SCC test removed 634 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1381 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 876 transition count 728
Reduce places removed 476 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 500 rules applied. Total rules applied 978 place count 400 transition count 704
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 990 place count 388 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 990 place count 388 transition count 657
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 1084 place count 341 transition count 657
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1101 place count 324 transition count 630
Iterating global reduction 3 with 17 rules applied. Total rules applied 1118 place count 324 transition count 630
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1121 place count 324 transition count 627
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1124 place count 321 transition count 627
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1124 place count 321 transition count 626
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 320 transition count 626
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1136 place count 310 transition count 612
Iterating global reduction 5 with 10 rules applied. Total rules applied 1146 place count 310 transition count 612
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1152 place count 310 transition count 606
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1154 place count 308 transition count 602
Iterating global reduction 6 with 2 rules applied. Total rules applied 1156 place count 308 transition count 602
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1158 place count 306 transition count 598
Iterating global reduction 6 with 2 rules applied. Total rules applied 1160 place count 306 transition count 598
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1161 place count 305 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 1162 place count 305 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1163 place count 304 transition count 594
Iterating global reduction 6 with 1 rules applied. Total rules applied 1164 place count 304 transition count 594
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1165 place count 303 transition count 592
Iterating global reduction 6 with 1 rules applied. Total rules applied 1166 place count 303 transition count 592
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1167 place count 302 transition count 585
Iterating global reduction 6 with 1 rules applied. Total rules applied 1168 place count 302 transition count 585
Performed 141 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 6 with 282 rules applied. Total rules applied 1450 place count 161 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 1461 place count 161 transition count 352
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1465 place count 157 transition count 347
Iterating global reduction 7 with 4 rules applied. Total rules applied 1469 place count 157 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 1495 place count 144 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 1509 place count 144 transition count 317
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1510 place count 143 transition count 315
Iterating global reduction 8 with 1 rules applied. Total rules applied 1511 place count 143 transition count 315
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -40
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 1545 place count 126 transition count 355
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 1568 place count 126 transition count 332
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1577 place count 117 transition count 314
Iterating global reduction 9 with 9 rules applied. Total rules applied 1586 place count 117 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1592 place count 117 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 10 with 39 rules applied. Total rules applied 1631 place count 117 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1632 place count 116 transition count 268
Applied a total of 1632 rules in 107 ms. Remains 116 /1520 variables (removed 1404) and now considering 268/1946 (removed 1678) transitions.
[2024-05-31 18:53:45] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
// Phase 1: matrix 211 rows 116 cols
[2024-05-31 18:53:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:53:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 18:53:45] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:53:45] [INFO ] Invariant cache hit.
[2024-05-31 18:53:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:53:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 177 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1520 places, 268/1946 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 266
Applied a total of 4 rules in 6 ms. Remains 112 /114 variables (removed 2) and now considering 266/268 (removed 2) transitions.
[2024-05-31 18:53:45] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
// Phase 1: matrix 209 rows 112 cols
[2024-05-31 18:53:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:53:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 18:53:45] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2024-05-31 18:53:45] [INFO ] Invariant cache hit.
[2024-05-31 18:53:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:53:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1520 places, 266/1946 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 446 ms. Remains : 112/1520 places, 266/1946 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLCardinality-13
Stuttering criterion allowed to conclude after 4795 steps with 499 reset in 19 ms.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLCardinality-13 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||X(X(p2))))'
Support contains 6 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1516 transition count 1942
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1515 transition count 1940
Applied a total of 11 rules in 131 ms. Remains 1515 /1520 variables (removed 5) and now considering 1940/1946 (removed 6) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-31 18:53:46] [INFO ] Computed 4 invariants in 17 ms
[2024-05-31 18:53:46] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-31 18:53:46] [INFO ] Invariant cache hit.
[2024-05-31 18:53:47] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-31 18:53:47] [INFO ] Invariant cache hit.
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/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1520 places, 1940/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61864 ms. Remains : 1515/1520 places, 1940/1946 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLCardinality-14
Product exploration explored 100000 steps with 779 reset in 212 ms.
Product exploration explored 100000 steps with 792 reset in 228 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1515 vertex of which 1506 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 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 140 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (305 resets) in 151 ms. (263 steps per ms) remains 1/3 properties
BEST_FIRST walk for 33603 steps (77 resets) in 43 ms. (763 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 1515 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Graph (trivial) has 1840 edges and 1515 vertex of which 671 / 1515 are part of one of the 61 SCC in 4 ms
Free SCC test removed 610 places
Ensure Unique test removed 710 transitions
Reduce isomorphic transitions removed 710 transitions.
Graph (complete) has 1401 edges and 905 vertex of which 896 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 483 place count 895 transition count 743
Reduce places removed 481 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 505 rules applied. Total rules applied 988 place count 414 transition count 719
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1003 place count 402 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1006 place count 399 transition count 716
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1006 place count 399 transition count 668
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1102 place count 351 transition count 668
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1118 place count 335 transition count 642
Iterating global reduction 4 with 16 rules applied. Total rules applied 1134 place count 335 transition count 642
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 1137 place count 335 transition count 639
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1140 place count 332 transition count 639
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1150 place count 322 transition count 625
Iterating global reduction 6 with 10 rules applied. Total rules applied 1160 place count 322 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1166 place count 322 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1168 place count 320 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1170 place count 320 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1172 place count 318 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1174 place count 318 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1176 place count 316 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1178 place count 316 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1180 place count 314 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1182 place count 314 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1184 place count 312 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1186 place count 312 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 310 transition count 585
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 310 transition count 585
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 1191 place count 310 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1192 place count 309 transition count 584
Performed 142 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1476 place count 167 transition count 362
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 1488 place count 167 transition count 350
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 1490 place count 166 transition count 349
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1494 place count 162 transition count 344
Iterating global reduction 11 with 4 rules applied. Total rules applied 1498 place count 162 transition count 344
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 11 with 24 rules applied. Total rules applied 1522 place count 150 transition count 329
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1534 place count 150 transition count 317
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 1570 place count 132 transition count 352
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 1588 place count 132 transition count 334
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1597 place count 123 transition count 316
Iterating global reduction 13 with 9 rules applied. Total rules applied 1606 place count 123 transition count 316
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1612 place count 123 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1648 place count 123 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1649 place count 122 transition count 273
Applied a total of 1649 rules in 103 ms. Remains 122 /1515 variables (removed 1393) and now considering 273/1940 (removed 1667) transitions.
[2024-05-31 18:54:49] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
// Phase 1: matrix 218 rows 122 cols
[2024-05-31 18:54:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:54:49] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-31 18:54:49] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
[2024-05-31 18:54:49] [INFO ] Invariant cache hit.
[2024-05-31 18:54:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:54:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [8, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 309 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1515 places, 273/1940 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 271
Applied a total of 4 rules in 7 ms. Remains 118 /120 variables (removed 2) and now considering 271/273 (removed 2) transitions.
[2024-05-31 18:54:49] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
// Phase 1: matrix 216 rows 118 cols
[2024-05-31 18:54:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:54:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:54:49] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
[2024-05-31 18:54:49] [INFO ] Invariant cache hit.
[2024-05-31 18:54:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:54:49] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1515 places, 271/1940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 589 ms. Remains : 118/1515 places, 271/1940 transitions.
Computed a total of 5 stabilizing places and 19 stable transitions
Computed a total of 5 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 38499 steps (3716 resets) in 561 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 435 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8250 reset in 148 ms.
Product exploration explored 100000 steps with 8245 reset in 153 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 271/271 transitions.
Graph (trivial) has 148 edges and 118 vertex of which 3 / 118 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 115 transition count 267
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 2 with 2 rules applied. Total rules applied 5 place count 114 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 114 transition count 265
Applied a total of 6 rules in 11 ms. Remains 114 /118 variables (removed 4) and now considering 265/271 (removed 6) transitions.
[2024-05-31 18:54:51] [INFO ] Flow matrix only has 210 transitions (discarded 55 similar events)
// Phase 1: matrix 210 rows 114 cols
[2024-05-31 18:54:51] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:54:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 18:54:51] [INFO ] Flow matrix only has 210 transitions (discarded 55 similar events)
[2024-05-31 18:54:51] [INFO ] Invariant cache hit.
[2024-05-31 18:54:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:54:51] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-31 18:54:51] [INFO ] Redundant transitions in 27 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-31 18:54:51] [INFO ] Flow matrix only has 210 transitions (discarded 55 similar events)
[2024-05-31 18:54:51] [INFO ] Invariant cache hit.
[2024-05-31 18:54:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 209/322 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/116 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 5 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 5 solved, 255 unsolved in 9185 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 209/322 variables, 113/113 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 2/115 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 255/370 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/370 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/371 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/371 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/372 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/372 constraints. Problems are: Problem set: 5 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/372 constraints. Problems are: Problem set: 5 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 372 constraints, problems are : Problem set: 5 solved, 255 unsolved in 14329 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 255/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 23652ms problems are : Problem set: 5 solved, 255 unsolved
Search for dead transitions found 5 dead transitions in 23655ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/118 places, 260/271 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 7 place count 107 transition count 242
Applied a total of 7 rules in 4 ms. Remains 107 /114 variables (removed 7) and now considering 242/260 (removed 18) transitions.
[2024-05-31 18:55:15] [INFO ] Flow matrix only has 191 transitions (discarded 51 similar events)
// Phase 1: matrix 191 rows 107 cols
[2024-05-31 18:55:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:55:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 18:55:15] [INFO ] Flow matrix only has 191 transitions (discarded 51 similar events)
[2024-05-31 18:55:15] [INFO ] Invariant cache hit.
[2024-05-31 18:55:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:55:15] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/118 places, 242/271 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24025 ms. Remains : 107/118 places, 242/271 transitions.
Treatment of property CloudReconfiguration-PT-310-LTLCardinality-14 finished in 89557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((!((p0 U p1) U p0) U (X(p1)&&X(p0)))))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-310-LTLCardinality-00
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 1520 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1520/1520 places, 1946/1946 transitions.
Graph (trivial) has 1851 edges and 1520 vertex of which 694 / 1520 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1384 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 879 transition count 736
Reduce places removed 471 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 495 rules applied. Total rules applied 968 place count 408 transition count 712
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 983 place count 396 transition count 709
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 986 place count 393 transition count 709
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 986 place count 393 transition count 662
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 1080 place count 346 transition count 662
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1096 place count 330 transition count 637
Iterating global reduction 4 with 16 rules applied. Total rules applied 1112 place count 330 transition count 637
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 1115 place count 330 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1118 place count 327 transition count 634
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1118 place count 327 transition count 633
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1120 place count 326 transition count 633
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1129 place count 317 transition count 621
Iterating global reduction 6 with 9 rules applied. Total rules applied 1138 place count 317 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1144 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1146 place count 315 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1148 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1150 place count 313 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1152 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1154 place count 311 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1156 place count 311 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1157 place count 310 transition count 601
Iterating global reduction 7 with 1 rules applied. Total rules applied 1158 place count 310 transition count 601
Performed 141 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1440 place count 169 transition count 379
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1454 place count 169 transition count 365
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1458 place count 165 transition count 360
Iterating global reduction 8 with 4 rules applied. Total rules applied 1462 place count 165 transition count 360
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 8 with 26 rules applied. Total rules applied 1488 place count 152 transition count 344
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1503 place count 152 transition count 329
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1504 place count 151 transition count 327
Iterating global reduction 9 with 1 rules applied. Total rules applied 1505 place count 151 transition count 327
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1541 place count 133 transition count 367
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1563 place count 133 transition count 345
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1572 place count 124 transition count 327
Iterating global reduction 10 with 9 rules applied. Total rules applied 1581 place count 124 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1586 place count 124 transition count 322
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1587 place count 124 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1588 place count 123 transition count 321
Applied a total of 1588 rules in 85 ms. Remains 123 /1520 variables (removed 1397) and now considering 321/1946 (removed 1625) transitions.
[2024-05-31 18:55:16] [INFO ] Flow matrix only has 265 transitions (discarded 56 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-05-31 18:55:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:55:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 18:55:16] [INFO ] Flow matrix only has 265 transitions (discarded 56 similar events)
[2024-05-31 18:55:16] [INFO ] Invariant cache hit.
[2024-05-31 18:55:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 18:55:16] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [15, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 265 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 121/1520 places, 321/1946 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 319
Applied a total of 4 rules in 3 ms. Remains 119 /121 variables (removed 2) and now considering 319/321 (removed 2) transitions.
[2024-05-31 18:55:16] [INFO ] Flow matrix only has 263 transitions (discarded 56 similar events)
// Phase 1: matrix 263 rows 119 cols
[2024-05-31 18:55:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:55:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 18:55:16] [INFO ] Flow matrix only has 263 transitions (discarded 56 similar events)
[2024-05-31 18:55:16] [INFO ] Invariant cache hit.
[2024-05-31 18:55:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 18:55:16] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 119/1520 places, 319/1946 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 514 ms. Remains : 119/1520 places, 319/1946 transitions.
Running random walk in product with property : CloudReconfiguration-PT-310-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 79 steps with 6 reset in 0 ms.
Treatment of property CloudReconfiguration-PT-310-LTLCardinality-00 finished in 941 ms.
FORMULA CloudReconfiguration-PT-310-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||X(X(p2))))'
[2024-05-31 18:55:16] [INFO ] Flatten gal took : 57 ms
[2024-05-31 18:55:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:55:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1520 places, 1946 transitions and 4063 arcs took 12 ms.
Total runtime 478473 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CloudReconfiguration-PT-310-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CloudReconfiguration-PT-310-LTLCardinality-14

BK_STOP 1717183503263

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CloudReconfiguration-PT-310-LTLCardinality-00
ltl formula formula --ltl=/tmp/1206/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1520 places, 1946 transitions and 4063 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.060 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1206/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1206/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1206/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1206/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1522 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1521, there are 2049 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~115!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 72
pnml2lts-mc( 0/ 4): unique states count: 922
pnml2lts-mc( 0/ 4): unique transitions count: 2014
pnml2lts-mc( 0/ 4): - self-loop count: 19
pnml2lts-mc( 0/ 4): - claim dead count: 65
pnml2lts-mc( 0/ 4): - claim found count: 123
pnml2lts-mc( 0/ 4): - claim success count: 963
pnml2lts-mc( 0/ 4): - cum. max stack depth: 656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 963 states 2067 transitions, fanout: 2.146
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9630, Transitions per second: 20670
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name CloudReconfiguration-PT-310-LTLCardinality-14
ltl formula formula --ltl=/tmp/1206/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1520 places, 1946 transitions and 4063 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1206/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1206/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1206/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1206/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 1521 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1521, there are 2066 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~329 levels ~10000 states ~21172 transitions
pnml2lts-mc( 3/ 4): ~370 levels ~20000 states ~45968 transitions
pnml2lts-mc( 1/ 4): ~718 levels ~40000 states ~102632 transitions
pnml2lts-mc( 1/ 4): ~718 levels ~80000 states ~206344 transitions
pnml2lts-mc( 1/ 4): ~794 levels ~160000 states ~399692 transitions
pnml2lts-mc( 1/ 4): ~794 levels ~320000 states ~883588 transitions
pnml2lts-mc( 3/ 4): ~5108 levels ~640000 states ~1966112 transitions
pnml2lts-mc( 1/ 4): ~9092 levels ~1280000 states ~3826884 transitions
pnml2lts-mc( 1/ 4): ~13437 levels ~2560000 states ~8340304 transitions
pnml2lts-mc( 1/ 4): ~32065 levels ~5120000 states ~17294608 transitions
pnml2lts-mc( 1/ 4): ~58911 levels ~10240000 states ~35876152 transitions
pnml2lts-mc( 1/ 4): ~74755 levels ~20480000 states ~73418380 transitions

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-310"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-310, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624188800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-310.tgz
mv CloudReconfiguration-PT-310 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;