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.r091-tall-171624187300227.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 greatspnxred
Input is CloudReconfiguration-PT-315, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 19:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 19:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 19:47 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-315-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-315-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716270720148

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:52:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 05:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:52:01] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 05:52:01] [INFO ] Transformed 2585 places.
[2024-05-21 05:52:01] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:52:01] [INFO ] Found NUPN structural information;
[2024-05-21 05:52:01] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1059 place count 2070 transition count 2551
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1296 place count 1833 transition count 2314
Iterating global reduction 1 with 237 rules applied. Total rules applied 1533 place count 1833 transition count 2314
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1621 place count 1745 transition count 2226
Iterating global reduction 1 with 88 rules applied. Total rules applied 1709 place count 1745 transition count 2226
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1725 place count 1745 transition count 2210
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1770 place count 1700 transition count 2165
Iterating global reduction 2 with 45 rules applied. Total rules applied 1815 place count 1700 transition count 2165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1822 place count 1700 transition count 2158
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1859 place count 1663 transition count 2117
Iterating global reduction 3 with 37 rules applied. Total rules applied 1896 place count 1663 transition count 2117
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1923 place count 1636 transition count 2090
Iterating global reduction 3 with 27 rules applied. Total rules applied 1950 place count 1636 transition count 2090
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1976 place count 1610 transition count 2064
Iterating global reduction 3 with 26 rules applied. Total rules applied 2002 place count 1610 transition count 2064
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2028 place count 1584 transition count 2038
Iterating global reduction 3 with 26 rules applied. Total rules applied 2054 place count 1584 transition count 2038
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2077 place count 1561 transition count 2001
Iterating global reduction 3 with 23 rules applied. Total rules applied 2100 place count 1561 transition count 2001
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2109 place count 1552 transition count 1986
Iterating global reduction 3 with 9 rules applied. Total rules applied 2118 place count 1552 transition count 1986
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2127 place count 1543 transition count 1974
Iterating global reduction 3 with 9 rules applied. Total rules applied 2136 place count 1543 transition count 1974
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2139 place count 1543 transition count 1971
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2142 place count 1540 transition count 1968
Iterating global reduction 4 with 3 rules applied. Total rules applied 2145 place count 1540 transition count 1968
Applied a total of 2145 rules in 1746 ms. Remains 1540 /2585 variables (removed 1045) and now considering 1968/3095 (removed 1127) transitions.
// Phase 1: matrix 1968 rows 1540 cols
[2024-05-21 05:52:03] [INFO ] Computed 4 invariants in 33 ms
[2024-05-21 05:52:04] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-21 05:52:04] [INFO ] Invariant cache hit.
[2024-05-21 05:52:05] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
Running 1967 sub problems to find dead transitions.
[2024-05-21 05:52:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/3508 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30077 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 1967/1967 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1967 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/3508 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 0/1967 constraints, Known Traps: 0/0 constraints]
After SMT, in 60779ms problems are : Problem set: 0 solved, 1967 unsolved
Search for dead transitions found 0 dead transitions in 60813ms
Starting structural reductions in LTL mode, iteration 1 : 1540/2585 places, 1968/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64157 ms. Remains : 1540/2585 places, 1968/3095 transitions.
Support contains 26 out of 1540 places after structural reductions.
[2024-05-21 05:53:06] [INFO ] Flatten gal took : 123 ms
[2024-05-21 05:53:06] [INFO ] Flatten gal took : 69 ms
[2024-05-21 05:53:06] [INFO ] Input system was already deterministic with 1968 transitions.
RANDOM walk for 40000 steps (301 resets) in 1704 ms. (23 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (88 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (96 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (95 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (99 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (90 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (93 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (86 resets) in 118 ms. (336 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (92 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (91 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (87 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
[2024-05-21 05:53:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1510/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3487 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3487 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/3489 variables, 1/1534 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3489 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3491 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3491 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/3493 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3493 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/3495 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3495 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/3497 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3497 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/3499 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3499 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 2/3501 variables, 1/1540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3501 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/3503 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3503 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 2/3505 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3505/3508 variables, and 1542 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1538/1540 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1510/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3487 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3487 variables, 10/1543 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3487 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/3489 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3489 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3491 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3491 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3493 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3493 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3495 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3495 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/3497 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3497 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/3499 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3499 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/3501 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3501/3508 variables, and 1550 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1536/1540 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10053ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1848 edges and 1540 vertex of which 689 / 1540 are part of one of the 63 SCC in 11 ms
Free SCC test removed 626 places
Drop transitions (Empty/Sink Transition effects.) removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Graph (complete) has 1355 edges and 914 vertex of which 905 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 905 transition count 682
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 535 rules applied. Total rules applied 1033 place count 416 transition count 636
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 33 rules applied. Total rules applied 1066 place count 387 transition count 632
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1070 place count 384 transition count 631
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1070 place count 384 transition count 581
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 1170 place count 334 transition count 581
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1180 place count 324 transition count 567
Iterating global reduction 4 with 10 rules applied. Total rules applied 1190 place count 324 transition count 567
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1192 place count 324 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1194 place count 322 transition count 565
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1199 place count 317 transition count 560
Iterating global reduction 6 with 5 rules applied. Total rules applied 1204 place count 317 transition count 560
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1209 place count 317 transition count 555
Performed 152 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 7 with 304 rules applied. Total rules applied 1513 place count 165 transition count 307
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1531 place count 165 transition count 289
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1534 place count 162 transition count 286
Iterating global reduction 8 with 3 rules applied. Total rules applied 1537 place count 162 transition count 286
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1561 place count 150 transition count 272
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1575 place count 150 transition count 258
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 1577 place count 149 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1580 place count 149 transition count 254
Performed 38 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 1656 place count 111 transition count 291
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 10 with 32 rules applied. Total rules applied 1688 place count 111 transition count 259
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 1708 place count 91 transition count 219
Iterating global reduction 11 with 20 rules applied. Total rules applied 1728 place count 91 transition count 219
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1738 place count 91 transition count 209
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1743 place count 86 transition count 199
Iterating global reduction 12 with 5 rules applied. Total rules applied 1748 place count 86 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1751 place count 86 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 1759 place count 86 transition count 188
Free-agglomeration rule applied 6 times.
Iterating global reduction 13 with 6 rules applied. Total rules applied 1765 place count 86 transition count 182
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1773 place count 80 transition count 180
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1776 place count 80 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1778 place count 80 transition count 178
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1779 place count 79 transition count 177
Iterating global reduction 14 with 1 rules applied. Total rules applied 1780 place count 79 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1781 place count 79 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1782 place count 79 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1783 place count 78 transition count 175
Applied a total of 1783 rules in 369 ms. Remains 78 /1540 variables (removed 1462) and now considering 175/1968 (removed 1793) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 78/1540 places, 175/1968 transitions.
RANDOM walk for 40000 steps (376 resets) in 257 ms. (155 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (160 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-21 05:53:18] [INFO ] Flow matrix only has 164 transitions (discarded 11 similar events)
// Phase 1: matrix 164 rows 78 cols
[2024-05-21 05:53:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 05:53:18] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/73 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/236 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 34/242 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2145 edges and 1540 vertex of which 1531 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 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 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1879 edges and 1540 vertex of which 700 / 1540 are part of one of the 63 SCC in 4 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1400 edges and 903 vertex of which 894 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 893 transition count 729
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 516 rules applied. Total rules applied 1011 place count 400 transition count 706
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1022 place count 389 transition count 706
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1022 place count 389 transition count 661
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1112 place count 344 transition count 661
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1126 place count 330 transition count 638
Iterating global reduction 3 with 14 rules applied. Total rules applied 1140 place count 330 transition count 638
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1142 place count 330 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1144 place count 328 transition count 636
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1153 place count 319 transition count 623
Iterating global reduction 5 with 9 rules applied. Total rules applied 1162 place count 319 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1167 place count 319 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1168 place count 318 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 1169 place count 318 transition count 616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1170 place count 317 transition count 614
Iterating global reduction 6 with 1 rules applied. Total rules applied 1171 place count 317 transition count 614
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1172 place count 316 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 1173 place count 316 transition count 612
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1174 place count 315 transition count 610
Iterating global reduction 6 with 1 rules applied. Total rules applied 1175 place count 315 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1176 place count 314 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 1177 place count 314 transition count 608
Performed 149 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 6 with 298 rules applied. Total rules applied 1475 place count 165 transition count 376
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1491 place count 165 transition count 360
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1496 place count 160 transition count 354
Iterating global reduction 7 with 5 rules applied. Total rules applied 1501 place count 160 transition count 354
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1502 place count 159 transition count 353
Iterating global reduction 7 with 1 rules applied. Total rules applied 1503 place count 159 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1504 place count 159 transition count 352
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1528 place count 147 transition count 338
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1541 place count 147 transition count 325
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1543 place count 145 transition count 319
Iterating global reduction 9 with 2 rules applied. Total rules applied 1545 place count 145 transition count 319
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 1547 place count 144 transition count 318
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1583 place count 126 transition count 357
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1606 place count 126 transition count 334
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1615 place count 117 transition count 316
Iterating global reduction 10 with 9 rules applied. Total rules applied 1624 place count 117 transition count 316
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1630 place count 117 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 11 with 40 rules applied. Total rules applied 1670 place count 117 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1671 place count 116 transition count 269
Applied a total of 1671 rules in 224 ms. Remains 116 /1540 variables (removed 1424) and now considering 269/1968 (removed 1699) transitions.
[2024-05-21 05:53:18] [INFO ] Flow matrix only has 211 transitions (discarded 58 similar events)
// Phase 1: matrix 211 rows 116 cols
[2024-05-21 05:53:18] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:53:19] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 05:53:19] [INFO ] Flow matrix only has 211 transitions (discarded 58 similar events)
[2024-05-21 05:53:19] [INFO ] Invariant cache hit.
[2024-05-21 05:53:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:53:19] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [45, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 346 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1540 places, 269/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 267
Applied a total of 2 rules in 7 ms. Remains 112 /114 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 05:53:19] [INFO ] Flow matrix only has 209 transitions (discarded 58 similar events)
// Phase 1: matrix 209 rows 112 cols
[2024-05-21 05:53:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:53:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 05:53:19] [INFO ] Flow matrix only has 209 transitions (discarded 58 similar events)
[2024-05-21 05:53:19] [INFO ] Invariant cache hit.
[2024-05-21 05:53:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:53:19] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1540 places, 267/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 844 ms. Remains : 112/1540 places, 267/1968 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-03
Stuttering criterion allowed to conclude after 8449 steps with 818 reset in 33 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-03 finished in 1109 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)||G(p1))))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1875 edges and 1540 vertex of which 700 / 1540 are part of one of the 63 SCC in 3 ms
Free SCC test removed 637 places
Ensure Unique test removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1400 edges and 903 vertex of which 894 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 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 893 transition count 732
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 513 rules applied. Total rules applied 1005 place count 403 transition count 709
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1016 place count 392 transition count 709
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1016 place count 392 transition count 664
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1106 place count 347 transition count 664
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1119 place count 334 transition count 643
Iterating global reduction 3 with 13 rules applied. Total rules applied 1132 place count 334 transition count 643
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1134 place count 334 transition count 641
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1136 place count 332 transition count 641
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1144 place count 324 transition count 630
Iterating global reduction 5 with 8 rules applied. Total rules applied 1152 place count 324 transition count 630
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1157 place count 324 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1158 place count 323 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 1159 place count 323 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1160 place count 322 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 1161 place count 322 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1162 place count 321 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 1163 place count 321 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1164 place count 320 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 1165 place count 320 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1166 place count 319 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1167 place count 319 transition count 615
Performed 148 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 6 with 296 rules applied. Total rules applied 1463 place count 171 transition count 384
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1478 place count 171 transition count 369
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1483 place count 166 transition count 363
Iterating global reduction 7 with 5 rules applied. Total rules applied 1488 place count 166 transition count 363
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1489 place count 165 transition count 362
Iterating global reduction 7 with 1 rules applied. Total rules applied 1490 place count 165 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1491 place count 165 transition count 361
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1515 place count 153 transition count 347
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1528 place count 153 transition count 334
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1529 place count 152 transition count 332
Iterating global reduction 9 with 1 rules applied. Total rules applied 1530 place count 152 transition count 332
Performed 20 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1570 place count 132 transition count 369
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1592 place count 132 transition count 347
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1600 place count 124 transition count 331
Iterating global reduction 10 with 8 rules applied. Total rules applied 1608 place count 124 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1613 place count 124 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 1655 place count 124 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1656 place count 123 transition count 283
Applied a total of 1656 rules in 203 ms. Remains 123 /1540 variables (removed 1417) and now considering 283/1968 (removed 1685) transitions.
[2024-05-21 05:53:19] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
// Phase 1: matrix 225 rows 123 cols
[2024-05-21 05:53:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:53:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 05:53:20] [INFO ] Flow matrix only has 225 transitions (discarded 58 similar events)
[2024-05-21 05:53:20] [INFO ] Invariant cache hit.
[2024-05-21 05:53:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:53:20] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [49, 117]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 277 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1540 places, 283/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 281
Applied a total of 2 rules in 7 ms. Remains 119 /121 variables (removed 2) and now considering 281/283 (removed 2) transitions.
[2024-05-21 05:53:20] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
// Phase 1: matrix 223 rows 119 cols
[2024-05-21 05:53:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:53:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:53:20] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2024-05-21 05:53:20] [INFO ] Invariant cache hit.
[2024-05-21 05:53:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:53:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1540 places, 281/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 630 ms. Remains : 119/1540 places, 281/1968 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-04 finished in 696 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(p0) U (G((G(p1)||X(p0)))||(!p1&&(G(p1)||X(p0))))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1524 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1524 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1524 transition count 1951
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 1517 transition count 1943
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1517 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 1513 transition count 1938
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 1513 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 1511 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 1510 transition count 1933
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 1509 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1931
Applied a total of 66 rules in 282 ms. Remains 1509 /1540 variables (removed 31) and now considering 1931/1968 (removed 37) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 05:53:20] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 05:53:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 05:53:21] [INFO ] Invariant cache hit.
[2024-05-21 05:53:22] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 05:53:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60896ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1540 places, 1931/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62475 ms. Remains : 1509/1540 places, 1931/1968 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-06
Product exploration explored 100000 steps with 784 reset in 281 ms.
Product exploration explored 100000 steps with 771 reset in 295 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 297 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (311 resets) in 271 ms. (147 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (90 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (94 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
[2024-05-21 05:54:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 818/821 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2267 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 818/821 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1498 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 2/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1515 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2173 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4470ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 114 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 355 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 48 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 05:54:29] [INFO ] Invariant cache hit.
[2024-05-21 05:54:30] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-21 05:54:30] [INFO ] Invariant cache hit.
[2024-05-21 05:54:31] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 05:54:31] [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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Finished structural reductions in LTL mode , in 1 iterations and 62213 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.20 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (AND p0 p1)), (X (X p1)), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (318 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (90 resets) in 291 ms. (137 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (95 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-05-21 05:55:32] [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) 819/821 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1305 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 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) 819/821 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/821 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1383 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2697ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (AND p0 p1)), (X (X p1)), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 772 reset in 202 ms.
Product exploration explored 100000 steps with 779 reset in 257 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Graph (trivial) has 1838 edges and 1509 vertex of which 693 / 1509 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1371 edges and 879 vertex of which 870 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
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 870 transition count 1194
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 486 place count 870 transition count 1183
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 486 place count 870 transition count 1195
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 506 place count 870 transition count 1195
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 786 place count 590 transition count 905
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1066 place count 590 transition count 905
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1077 place count 579 transition count 890
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1088 place count 579 transition count 890
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1093 place count 579 transition count 885
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1104 place count 568 transition count 874
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1115 place count 568 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1117 place count 566 transition count 870
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 566 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1121 place count 564 transition count 866
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1123 place count 564 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1127 place count 560 transition count 862
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1131 place count 560 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 558 transition count 858
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 558 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 556 transition count 854
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1143 place count 552 transition count 848
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1147 place count 552 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1151 place count 548 transition count 832
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1155 place count 548 transition count 832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1156 place count 548 transition count 832
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1160 place count 544 transition count 828
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1164 place count 544 transition count 828
Performed 104 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 1 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1268 place count 544 transition count 901
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1306 place count 544 transition count 863
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1406 place count 444 transition count 753
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1506 place count 444 transition count 753
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1512 place count 438 transition count 744
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1518 place count 438 transition count 744
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1525 place count 438 transition count 744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1529 place count 438 transition count 740
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1544 place count 423 transition count 721
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1559 place count 423 transition count 721
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1565 place count 423 transition count 715
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1569 place count 419 transition count 711
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1573 place count 419 transition count 711
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1576 place count 419 transition count 711
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1582 place count 419 transition count 705
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1585 place count 416 transition count 702
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1588 place count 416 transition count 702
Performed 71 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1659 place count 416 transition count 1032
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1780 place count 416 transition count 911
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1904 place count 292 transition count 578
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2028 place count 292 transition count 578
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 2045 place count 292 transition count 561
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2072 place count 265 transition count 504
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2099 place count 265 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2101 place count 265 transition count 536
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2103 place count 263 transition count 518
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2105 place count 263 transition count 518
Deduced a syphon composed of 139 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2151 place count 263 transition count 472
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2155 place count 259 transition count 468
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2159 place count 259 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2162 place count 259 transition count 528
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2165 place count 256 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2168 place count 256 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2168 rules in 332 ms. Remains 256 /1509 variables (removed 1253) and now considering 513/1931 (removed 1418) transitions.
[2024-05-21 05:55:37] [INFO ] Redundant transitions in 27 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-21 05:55:37] [INFO ] Flow matrix only has 456 transitions (discarded 57 similar events)
// Phase 1: matrix 456 rows 256 cols
[2024-05-21 05:55:37] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 05:55:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (OVERLAPS) 455/710 variables, 255/255 constraints. Problems are: Problem set: 240 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/710 variables, 2/257 constraints. Problems are: Problem set: 240 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/710 variables, 0/257 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/711 variables, 1/258 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/711 variables, 0/258 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/712 variables, 1/259 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/259 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 0/712 variables, 0/259 constraints. Problems are: Problem set: 245 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 259 constraints, problems are : Problem set: 245 solved, 267 unsolved in 20973 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 245 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 452/572 variables, 120/120 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/122 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 267/389 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/389 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 139/711 variables, 136/525 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/711 variables, 0/525 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/712 variables, 1/526 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 0/526 constraints. Problems are: Problem set: 245 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/712 variables, 0/526 constraints. Problems are: Problem set: 245 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 712/712 variables, and 526 constraints, problems are : Problem set: 245 solved, 267 unsolved in 27901 ms.
Refiners :[State Equation: 256/256 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 267/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 49138ms problems are : Problem set: 245 solved, 267 unsolved
Search for dead transitions found 245 dead transitions in 49145ms
Found 245 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 245 transitions
Dead transitions reduction (with SMT) removed 245 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1509 places, 268/1931 transitions.
Graph (complete) has 414 edges and 256 vertex of which 121 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.1 ms
Discarding 135 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 114 transition count 250
Applied a total of 8 rules in 20 ms. Remains 114 /256 variables (removed 142) and now considering 250/268 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1509 places, 250/1931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49532 ms. Remains : 114/1509 places, 250/1931 transitions.
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 61 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 05:56:26] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 05:56:26] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-21 05:56:26] [INFO ] Invariant cache hit.
[2024-05-21 05:56:27] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 05:56:27] [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 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.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 1.0)
(s129 1.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 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 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 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 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 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60605ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Finished structural reductions in LTL mode , in 1 iterations and 62092 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-06 finished in 248094 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' '!((G(p0) U X(X(p1))))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1525 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1519 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1519 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1519 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1516 transition count 1941
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 1514 transition count 1939
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 1514 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 1513 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1935
Applied a total of 59 rules in 341 ms. Remains 1512 /1540 variables (removed 28) and now considering 1935/1968 (removed 33) transitions.
// Phase 1: matrix 1935 rows 1512 cols
[2024-05-21 05:57:28] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 05:57:29] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 05:57:29] [INFO ] Invariant cache hit.
[2024-05-21 05:57:30] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 05:57:30] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1540 places, 1935/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62181 ms. Remains : 1512/1540 places, 1935/1968 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 328 ms.
Product exploration explored 100000 steps with 33333 reset in 426 ms.
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2112 edges and 1512 vertex of which 1503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 28 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-07 finished in 63299 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(p0)))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1523 transition count 1951
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1523 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1523 transition count 1950
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 1516 transition count 1942
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 1516 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 1513 transition count 1938
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 1513 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1512 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1935
Applied a total of 60 rules in 255 ms. Remains 1512 /1540 variables (removed 28) and now considering 1935/1968 (removed 33) transitions.
// Phase 1: matrix 1935 rows 1512 cols
[2024-05-21 05:58:32] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:58:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 05:58:32] [INFO ] Invariant cache hit.
[2024-05-21 05:58:33] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 05:58:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 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 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1540 places, 1935/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61878 ms. Remains : 1512/1540 places, 1935/1968 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-10 finished in 61980 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' '!(G((F(p0)&&F(!p0))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1879 edges and 1540 vertex of which 701 / 1540 are part of one of the 63 SCC in 3 ms
Free SCC test removed 638 places
Ensure Unique test removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Graph (complete) has 1398 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 892 transition count 730
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 513 rules applied. Total rules applied 1005 place count 402 transition count 707
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1017 place count 391 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1018 place count 390 transition count 706
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1018 place count 390 transition count 661
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1108 place count 345 transition count 661
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1122 place count 331 transition count 638
Iterating global reduction 4 with 14 rules applied. Total rules applied 1136 place count 331 transition count 638
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1138 place count 331 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1140 place count 329 transition count 636
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1149 place count 320 transition count 623
Iterating global reduction 6 with 9 rules applied. Total rules applied 1158 place count 320 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1163 place count 320 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1165 place count 318 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1167 place count 318 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1169 place count 316 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1171 place count 316 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1173 place count 314 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1175 place count 314 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1177 place count 312 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1179 place count 312 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1181 place count 310 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1183 place count 310 transition count 598
Performed 148 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1479 place count 162 transition count 367
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1495 place count 162 transition count 351
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1501 place count 156 transition count 340
Iterating global reduction 8 with 6 rules applied. Total rules applied 1507 place count 156 transition count 340
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1508 place count 155 transition count 339
Iterating global reduction 8 with 1 rules applied. Total rules applied 1509 place count 155 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1510 place count 155 transition count 338
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1534 place count 143 transition count 324
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1546 place count 143 transition count 312
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1547 place count 142 transition count 308
Iterating global reduction 10 with 1 rules applied. Total rules applied 1548 place count 142 transition count 308
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 1550 place count 141 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1552 place count 141 transition count 305
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1586 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1603 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1612 place count 115 transition count 304
Iterating global reduction 12 with 9 rules applied. Total rules applied 1621 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1627 place count 115 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1663 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1664 place count 114 transition count 261
Applied a total of 1664 rules in 90 ms. Remains 114 /1540 variables (removed 1426) and now considering 261/1968 (removed 1707) transitions.
[2024-05-21 05:59:33] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2024-05-21 05:59:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:59:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 05:59:34] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-21 05:59:34] [INFO ] Invariant cache hit.
[2024-05-21 05:59:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:59:34] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [41, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 441 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1540 places, 261/1968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 260
Applied a total of 2 rules in 3 ms. Remains 111 /112 variables (removed 1) and now considering 260/261 (removed 1) transitions.
[2024-05-21 05:59:34] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 111 cols
[2024-05-21 05:59:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:59:34] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-21 05:59:34] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 05:59:34] [INFO ] Invariant cache hit.
[2024-05-21 05:59:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:59:34] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1540 places, 260/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 986 ms. Remains : 111/1540 places, 260/1968 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), p0]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-11 finished in 1099 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(p0)))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1524 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1524 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1524 transition count 1951
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 1516 transition count 1942
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 1516 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 1512 transition count 1937
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 1512 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 1510 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 1510 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 1509 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 1508 transition count 1930
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1930
Applied a total of 68 rules in 408 ms. Remains 1508 /1540 variables (removed 32) and now considering 1930/1968 (removed 38) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 05:59:35] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:59:35] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 05:59:35] [INFO ] Invariant cache hit.
[2024-05-21 05:59:36] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1540 places, 1930/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62088 ms. Remains : 1508/1540 places, 1930/1968 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-12 finished in 63055 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(X(F(p0))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1522 transition count 1950
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1522 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1522 transition count 1949
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 1514 transition count 1940
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1514 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 1510 transition count 1935
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 1508 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 1507 transition count 1930
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 1506 transition count 1928
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 1506 transition count 1928
Applied a total of 72 rules in 377 ms. Remains 1506 /1540 variables (removed 34) and now considering 1928/1968 (removed 40) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 06:00:38] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 06:00:38] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 06:00:38] [INFO ] Invariant cache hit.
[2024-05-21 06:00:39] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1928/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62157 ms. Remains : 1506/1540 places, 1928/1968 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 327 ms.
Product exploration explored 100000 steps with 33333 reset in 341 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-13 finished in 62972 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' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1874 edges and 1540 vertex of which 695 / 1540 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1405 edges and 908 vertex of which 899 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 898 transition count 734
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 516 rules applied. Total rules applied 1011 place count 405 transition count 711
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1022 place count 394 transition count 711
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1022 place count 394 transition count 666
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1112 place count 349 transition count 666
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1126 place count 335 transition count 643
Iterating global reduction 3 with 14 rules applied. Total rules applied 1140 place count 335 transition count 643
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1142 place count 335 transition count 641
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1144 place count 333 transition count 641
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1153 place count 324 transition count 628
Iterating global reduction 5 with 9 rules applied. Total rules applied 1162 place count 324 transition count 628
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1167 place count 324 transition count 623
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1169 place count 322 transition count 619
Iterating global reduction 6 with 2 rules applied. Total rules applied 1171 place count 322 transition count 619
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1173 place count 320 transition count 615
Iterating global reduction 6 with 2 rules applied. Total rules applied 1175 place count 320 transition count 615
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1177 place count 318 transition count 611
Iterating global reduction 6 with 2 rules applied. Total rules applied 1179 place count 318 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1181 place count 316 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1183 place count 316 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1185 place count 314 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1187 place count 314 transition count 603
Performed 147 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 6 with 294 rules applied. Total rules applied 1481 place count 167 transition count 373
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1495 place count 167 transition count 359
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1500 place count 162 transition count 353
Iterating global reduction 7 with 5 rules applied. Total rules applied 1505 place count 162 transition count 353
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1506 place count 161 transition count 352
Iterating global reduction 7 with 1 rules applied. Total rules applied 1507 place count 161 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1508 place count 161 transition count 351
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1532 place count 149 transition count 337
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1545 place count 149 transition count 324
Performed 18 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
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 1581 place count 131 transition count 361
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1602 place count 131 transition count 340
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1611 place count 122 transition count 322
Iterating global reduction 10 with 9 rules applied. Total rules applied 1620 place count 122 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1626 place count 122 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 11 with 39 rules applied. Total rules applied 1665 place count 122 transition count 277
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 1666 place count 122 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1667 place count 121 transition count 276
Applied a total of 1667 rules in 86 ms. Remains 121 /1540 variables (removed 1419) and now considering 276/1968 (removed 1692) transitions.
[2024-05-21 06:01:41] [INFO ] Flow matrix only has 221 transitions (discarded 55 similar events)
// Phase 1: matrix 221 rows 121 cols
[2024-05-21 06:01:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:01:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 06:01:41] [INFO ] Flow matrix only has 221 transitions (discarded 55 similar events)
[2024-05-21 06:01:41] [INFO ] Invariant cache hit.
[2024-05-21 06:01:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:01:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [48, 115]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 264 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1540 places, 276/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 274
Applied a total of 2 rules in 4 ms. Remains 117 /119 variables (removed 2) and now considering 274/276 (removed 2) transitions.
[2024-05-21 06:01:41] [INFO ] Flow matrix only has 219 transitions (discarded 55 similar events)
// Phase 1: matrix 219 rows 117 cols
[2024-05-21 06:01:41] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:01:41] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 06:01:41] [INFO ] Flow matrix only has 219 transitions (discarded 55 similar events)
[2024-05-21 06:01:41] [INFO ] Invariant cache hit.
[2024-05-21 06:01:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:01:41] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1540 places, 274/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 567 ms. Remains : 117/1540 places, 274/1968 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLCardinality-14
Product exploration explored 100000 steps with 9594 reset in 244 ms.
Product exploration explored 100000 steps with 9645 reset in 172 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 195 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 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4774 resets) in 227 ms. (175 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (938 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-05-21 06:01:42] [INFO ] Flow matrix only has 219 transitions (discarded 55 similar events)
[2024-05-21 06:01:42] [INFO ] Invariant cache hit.
[2024-05-21 06:01:42] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/124 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/327 variables, 97/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/335 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/336 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/124 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 203/327 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 335/336 variables, and 122 constraints, problems are : Problem set: 1 solved, 0 unsolved in 101 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLCardinality-14 finished in 1877 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(p0) U (G((G(p1)||X(p0)))||(!p1&&(G(p1)||X(p0))))))'
[2024-05-21 06:01:42] [INFO ] Flatten gal took : 71 ms
[2024-05-21 06:01:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 06:01:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1540 places, 1968 transitions and 4107 arcs took 16 ms.
Total runtime 581710 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-315

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1540
TRANSITIONS: 1968
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.004s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1173
MODEL NAME: /home/mcc/execution/410/model
1540 places, 1968 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-315-LTLCardinality-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716271795322

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

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-315"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CloudReconfiguration-PT-315, 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 r091-tall-171624187300227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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