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.r092-tall-171624188600131.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 itstools
Input is CloudReconfiguration-PT-303, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624188600131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 4.1K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 19:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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-303-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-303-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716263866200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-303
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 03:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:57:47] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-21 03:57:47] [INFO ] Transformed 2584 places.
[2024-05-21 03:57:47] [INFO ] Transformed 3094 transitions.
[2024-05-21 03:57:47] [INFO ] Found NUPN structural information;
[2024-05-21 03:57:47] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 290 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 4 formulas.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 514 places :
Symmetric choice reduction at 0 with 514 rule applications. Total rules 514 place count 2070 transition count 2580
Iterating global reduction 0 with 514 rules applied. Total rules applied 1028 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1056 place count 2070 transition count 2552
Discarding 234 places :
Symmetric choice reduction at 1 with 234 rule applications. Total rules 1290 place count 1836 transition count 2318
Iterating global reduction 1 with 234 rules applied. Total rules applied 1524 place count 1836 transition count 2318
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 1610 place count 1750 transition count 2232
Iterating global reduction 1 with 86 rules applied. Total rules applied 1696 place count 1750 transition count 2232
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1712 place count 1750 transition count 2216
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1760 place count 1702 transition count 2168
Iterating global reduction 2 with 48 rules applied. Total rules applied 1808 place count 1702 transition count 2168
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1816 place count 1702 transition count 2160
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1855 place count 1663 transition count 2116
Iterating global reduction 3 with 39 rules applied. Total rules applied 1894 place count 1663 transition count 2116
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1921 place count 1636 transition count 2089
Iterating global reduction 3 with 27 rules applied. Total rules applied 1948 place count 1636 transition count 2089
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1973 place count 1611 transition count 2064
Iterating global reduction 3 with 25 rules applied. Total rules applied 1998 place count 1611 transition count 2064
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2023 place count 1586 transition count 2039
Iterating global reduction 3 with 25 rules applied. Total rules applied 2048 place count 1586 transition count 2039
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2069 place count 1565 transition count 2005
Iterating global reduction 3 with 21 rules applied. Total rules applied 2090 place count 1565 transition count 2005
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2098 place count 1557 transition count 1991
Iterating global reduction 3 with 8 rules applied. Total rules applied 2106 place count 1557 transition count 1991
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2113 place count 1550 transition count 1981
Iterating global reduction 3 with 7 rules applied. Total rules applied 2120 place count 1550 transition count 1981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2122 place count 1550 transition count 1979
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2125 place count 1547 transition count 1976
Iterating global reduction 4 with 3 rules applied. Total rules applied 2128 place count 1547 transition count 1976
Applied a total of 2128 rules in 1552 ms. Remains 1547 /2584 variables (removed 1037) and now considering 1976/3094 (removed 1118) transitions.
// Phase 1: matrix 1976 rows 1547 cols
[2024-05-21 03:57:49] [INFO ] Computed 4 invariants in 39 ms
[2024-05-21 03:57:50] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-21 03:57:50] [INFO ] Invariant cache hit.
[2024-05-21 03:57:51] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned [1536]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1633 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1546/2584 places, 1976/3094 transitions.
Applied a total of 0 rules in 38 ms. Remains 1546 /1546 variables (removed 0) and now considering 1976/1976 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3238 ms. Remains : 1546/2584 places, 1976/3094 transitions.
Support contains 40 out of 1546 places after structural reductions.
[2024-05-21 03:57:51] [INFO ] Flatten gal took : 135 ms
[2024-05-21 03:57:51] [INFO ] Flatten gal took : 75 ms
[2024-05-21 03:57:51] [INFO ] Input system was already deterministic with 1976 transitions.
Support contains 36 out of 1546 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (436 resets) in 1626 ms. (24 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (13 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 26 ms. (148 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
// Phase 1: matrix 1976 rows 1546 cols
[2024-05-21 03:57:52] [INFO ] Computed 3 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1524 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1524 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3482 variables, 1524/1527 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3482 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 6/3488 variables, 4/1531 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3488 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 6/3494 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3494 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 6/3500 variables, 3/1537 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3500 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 6/3506 variables, 3/1540 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3506 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 3/3509 variables, 2/1542 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3509/3522 variables, and 1542 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1539/1546 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1524 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1524 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3482 variables, 1524/1527 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3482 variables, 14/1541 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3482 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 6/3488 variables, 4/1545 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3488 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3488 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 6/3494 variables, 3/1549 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3494 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 6/3500 variables, 3/1552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3500 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 6/3506 variables, 3/1555 constraints. Problems are: Problem set: 0 solved, 15 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 3506/3522 variables, and 1555 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1537/1546 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10087ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 1546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Graph (trivial) has 1839 edges and 1546 vertex of which 643 / 1546 are part of one of the 61 SCC in 13 ms
Free SCC test removed 582 places
Drop transitions (Empty/Sink Transition effects.) removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1415 edges and 964 vertex of which 956 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 514 transitions
Trivial Post-agglo rules discarded 514 transitions
Performed 514 trivial Post agglomeration. Transition count delta: 514
Iterating post reduction 0 with 521 rules applied. Total rules applied 523 place count 956 transition count 720
Reduce places removed 514 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 563 rules applied. Total rules applied 1086 place count 442 transition count 671
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 1119 place count 411 transition count 669
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1122 place count 410 transition count 667
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1125 place count 409 transition count 665
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 8 rules applied. Total rules applied 1133 place count 408 transition count 658
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1141 place count 401 transition count 657
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 53 Pre rules applied. Total rules applied 1141 place count 401 transition count 604
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1247 place count 348 transition count 604
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1257 place count 338 transition count 591
Iterating global reduction 7 with 10 rules applied. Total rules applied 1267 place count 338 transition count 591
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1268 place count 338 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1269 place count 337 transition count 590
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1275 place count 331 transition count 584
Iterating global reduction 9 with 6 rules applied. Total rules applied 1281 place count 331 transition count 584
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1287 place count 331 transition count 578
Performed 162 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 162 places in 1 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 10 with 324 rules applied. Total rules applied 1611 place count 169 transition count 322
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1632 place count 169 transition count 301
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1635 place count 166 transition count 298
Iterating global reduction 11 with 3 rules applied. Total rules applied 1638 place count 166 transition count 298
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1658 place count 156 transition count 287
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1670 place count 156 transition count 275
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1671 place count 155 transition count 273
Iterating global reduction 12 with 1 rules applied. Total rules applied 1672 place count 155 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1673 place count 155 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1675 place count 154 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1678 place count 154 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1680 place count 153 transition count 267
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 1681 place count 153 transition count 266
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 15 with 66 rules applied. Total rules applied 1747 place count 120 transition count 304
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 15 with 37 rules applied. Total rules applied 1784 place count 120 transition count 267
Discarding 18 places :
Symmetric choice reduction at 16 with 18 rule applications. Total rules 1802 place count 102 transition count 238
Iterating global reduction 16 with 18 rules applied. Total rules applied 1820 place count 102 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 1831 place count 102 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 17 with 30 rules applied. Total rules applied 1861 place count 102 transition count 197
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 1864 place count 99 transition count 192
Iterating global reduction 17 with 3 rules applied. Total rules applied 1867 place count 99 transition count 192
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1868 place count 98 transition count 191
Iterating global reduction 17 with 1 rules applied. Total rules applied 1869 place count 98 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1870 place count 98 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1871 place count 98 transition count 189
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 1876 place count 98 transition count 184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 1881 place count 93 transition count 184
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 1886 place count 93 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1887 place count 93 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1888 place count 92 transition count 182
Applied a total of 1888 rules in 217 ms. Remains 92 /1546 variables (removed 1454) and now considering 182/1976 (removed 1794) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 92/1546 places, 182/1976 transitions.
RANDOM walk for 38985 steps (490 resets) in 758 ms. (51 steps per ms) remains 0/15 properties
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2151 edges and 1546 vertex of which 1538 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.27 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((X(!p0)||(p1&&F(p0)))) U p1))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1525 transition count 1954
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1525 transition count 1954
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 1525 transition count 1952
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 1515 transition count 1942
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 1515 transition count 1942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 1515 transition count 1939
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 1511 transition count 1935
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1509 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 1507 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 1507 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 1505 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1504 transition count 1927
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1504 transition count 1927
Applied a total of 89 rules in 431 ms. Remains 1504 /1546 variables (removed 42) and now considering 1927/1976 (removed 49) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2024-05-21 03:58:03] [INFO ] Computed 3 invariants in 27 ms
[2024-05-21 03:58:03] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 03:58:03] [INFO ] Invariant cache hit.
[2024-05-21 03:58:04] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2024-05-21 03:58:04] [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/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30064 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints]
After SMT, in 60731ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60759ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1546 places, 1927/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62348 ms. Remains : 1504/1546 places, 1927/1976 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), p0, (AND (NOT p1) p0), true]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-01 finished in 62694 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((p1&&F(p2)))&&p0)))'
Support contains 6 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1528 transition count 1957
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1528 transition count 1957
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1528 transition count 1955
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 1520 transition count 1947
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 1520 transition count 1947
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 1520 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 1516 transition count 1941
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1514 transition count 1939
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1933
Applied a total of 78 rules in 385 ms. Remains 1509 /1546 variables (removed 37) and now considering 1933/1976 (removed 43) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2024-05-21 03:59:06] [INFO ] Computed 3 invariants in 16 ms
[2024-05-21 03:59:06] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 03:59:06] [INFO ] Invariant cache hit.
[2024-05-21 03:59:07] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 03:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1546 places, 1933/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62141 ms. Remains : 1509/1546 places, 1933/1976 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-02 finished in 62380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Graph (trivial) has 1887 edges and 1546 vertex of which 701 / 1546 are part of one of the 63 SCC in 4 ms
Free SCC test removed 638 places
Ensure Unique test removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Graph (complete) has 1403 edges and 908 vertex of which 900 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 899 transition count 729
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 524 rules applied. Total rules applied 1025 place count 400 transition count 704
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1037 place count 388 transition count 704
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1037 place count 388 transition count 658
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1129 place count 342 transition count 658
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1146 place count 325 transition count 632
Iterating global reduction 3 with 17 rules applied. Total rules applied 1163 place count 325 transition count 632
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1164 place count 325 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1165 place count 324 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1165 place count 324 transition count 630
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1167 place count 323 transition count 630
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1179 place count 311 transition count 613
Iterating global reduction 5 with 12 rules applied. Total rules applied 1191 place count 311 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 1198 place count 311 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1199 place count 310 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1201 place count 308 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1203 place count 308 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1205 place count 306 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1207 place count 306 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1209 place count 304 transition count 594
Iterating global reduction 7 with 2 rules applied. Total rules applied 1211 place count 304 transition count 594
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1213 place count 302 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 1215 place count 302 transition count 590
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1217 place count 300 transition count 586
Iterating global reduction 7 with 2 rules applied. Total rules applied 1219 place count 300 transition count 586
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1220 place count 299 transition count 579
Iterating global reduction 7 with 1 rules applied. Total rules applied 1221 place count 299 transition count 579
Performed 140 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 7 with 280 rules applied. Total rules applied 1501 place count 159 transition count 359
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1514 place count 159 transition count 346
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1520 place count 153 transition count 335
Iterating global reduction 8 with 6 rules applied. Total rules applied 1526 place count 153 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1527 place count 153 transition count 334
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1553 place count 140 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1567 place count 140 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 10 with 34 rules applied. Total rules applied 1601 place count 123 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1618 place count 123 transition count 322
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1627 place count 114 transition count 304
Iterating global reduction 11 with 9 rules applied. Total rules applied 1636 place count 114 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1642 place count 114 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1678 place count 114 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1679 place count 113 transition count 261
Applied a total of 1679 rules in 133 ms. Remains 113 /1546 variables (removed 1433) and now considering 261/1976 (removed 1715) transitions.
[2024-05-21 04:00:08] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 113 cols
[2024-05-21 04:00:08] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 04:00:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 04:00:08] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-21 04:00:08] [INFO ] Invariant cache hit.
[2024-05-21 04:00:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:00:08] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [40, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 170 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1546 places, 261/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 258
Applied a total of 4 rules in 6 ms. Remains 107 /110 variables (removed 3) and now considering 258/261 (removed 3) transitions.
[2024-05-21 04:00:08] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
// Phase 1: matrix 201 rows 107 cols
[2024-05-21 04:00:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:00:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 04:00:08] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2024-05-21 04:00:08] [INFO ] Invariant cache hit.
[2024-05-21 04:00:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 04:00:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1546 places, 258/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 432 ms. Remains : 107/1546 places, 258/1976 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-04 finished in 479 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(((G(p0) U G((X(p2)||p1)))||X(F(p3))))))'
Support contains 4 out of 1546 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1527 transition count 1956
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1527 transition count 1956
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1527 transition count 1954
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 1518 transition count 1945
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 1518 transition count 1945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 1518 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 1514 transition count 1939
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1508 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1508 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1507 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1507 transition count 1931
Applied a total of 82 rules in 516 ms. Remains 1507 /1546 variables (removed 39) and now considering 1931/1976 (removed 45) transitions.
// Phase 1: matrix 1931 rows 1507 cols
[2024-05-21 04:00:09] [INFO ] Computed 3 invariants in 18 ms
[2024-05-21 04:00:09] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 04:00:09] [INFO ] Invariant cache hit.
[2024-05-21 04:00:10] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 04:00:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 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/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60597ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60620ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1546 places, 1931/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62284 ms. Remains : 1507/1546 places, 1931/1976 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-05
Product exploration explored 100000 steps with 1058 reset in 283 ms.
Product exploration explored 100000 steps with 1101 reset in 222 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2104 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 6
RANDOM walk for 40000 steps (422 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (154 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (153 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (140 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (145 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (156 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (133 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 313962 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 6
Probabilistic random walk after 313962 steps, saw 81105 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-21 04:01:15] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1079/1083 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 0/1487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 7/3404 variables, 5/1492 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3404 variables, 0/1492 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/3410 variables, 3/1495 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3410 variables, 0/1495 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/3416 variables, 3/1498 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3416 variables, 0/1498 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/3422 variables, 3/1501 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 0/1501 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/3425 variables, 2/1503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/3438 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1510 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3663 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1079/1083 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 5/1492 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3397 variables, 0/1492 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 7/3404 variables, 5/1497 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3404 variables, 0/1497 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/3410 variables, 3/1500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3410 variables, 0/1500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/3416 variables, 3/1503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3416 variables, 0/1503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/3422 variables, 3/1506 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 3/3425 variables, 2/1508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 1/3438 variables, 1/1515 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3438/3438 variables, and 1515 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4201 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7876ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 166 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 14 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) p2), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (G (OR p1 (NOT p2) p3)), (G (OR (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (AND p1 p2 (NOT p3)))), (F (NOT (OR p1 p3))), (F (NOT (AND p1 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F p3), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 1507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1931/1931 transitions.
Applied a total of 0 rules in 53 ms. Remains 1507 /1507 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 04:01:24] [INFO ] Invariant cache hit.
[2024-05-21 04:01:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 04:01:24] [INFO ] Invariant cache hit.
[2024-05-21 04:01:25] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 04:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 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/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Finished structural reductions in LTL mode , in 1 iterations and 61745 ms. Remains : 1507/1507 places, 1931/1931 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2104 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p3)), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (421 resets) in 419 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (146 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
[2024-05-21 04:02:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1079/1083 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/3404 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3404 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3410 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3410 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3416 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3416 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/3422 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/3425 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1957 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1079/1083 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1484 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3397 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 2/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/3404 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3404 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3410 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3410 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3416 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/3422 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/3425 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/3438 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3438/3438 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2104 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4083ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8141 steps, including 163 resets, run visited all 2 properties in 105 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 106 ms.
Knowledge obtained : [(AND p2 (NOT p3)), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (AND p2 (NOT p3)))), (F p3)]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1075 reset in 148 ms.
Product exploration explored 100000 steps with 1086 reset in 232 ms.
Built C files in :
/tmp/ltsmin7900086540382827510
[2024-05-21 04:02:32] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7900086540382827510
Running compilation step : cd /tmp/ltsmin7900086540382827510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7900086540382827510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7900086540382827510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1931/1931 transitions.
Applied a total of 0 rules in 60 ms. Remains 1507 /1507 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 04:02:35] [INFO ] Invariant cache hit.
[2024-05-21 04:02:35] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 04:02:35] [INFO ] Invariant cache hit.
[2024-05-21 04:02:36] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 04:02:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30054 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 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/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3438 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Finished structural reductions in LTL mode , in 1 iterations and 61791 ms. Remains : 1507/1507 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin6803712199239995772
[2024-05-21 04:03:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6803712199239995772
Running compilation step : cd /tmp/ltsmin6803712199239995772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6803712199239995772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6803712199239995772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 04:03:40] [INFO ] Flatten gal took : 58 ms
[2024-05-21 04:03:40] [INFO ] Flatten gal took : 64 ms
[2024-05-21 04:03:40] [INFO ] Time to serialize gal into /tmp/LTL2758588677698951122.gal : 20 ms
[2024-05-21 04:03:40] [INFO ] Time to serialize properties into /tmp/LTL12846689391767920800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2758588677698951122.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12007668338943586428.hoa' '-atoms' '/tmp/LTL12846689391767920800.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12846689391767920800.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12007668338943586428.hoa
Detected timeout of ITS tools.
[2024-05-21 04:03:55] [INFO ] Flatten gal took : 47 ms
[2024-05-21 04:03:55] [INFO ] Flatten gal took : 64 ms
[2024-05-21 04:03:55] [INFO ] Time to serialize gal into /tmp/LTL5645418876671524754.gal : 25 ms
[2024-05-21 04:03:55] [INFO ] Time to serialize properties into /tmp/LTL1201015278254703357.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5645418876671524754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1201015278254703357.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p2135==0)||(p1445==1))"))U(G(("((p266==0)||(p465==1))")||(X("((p266==0)||(p465==1))")))))||(X(F("((p1404==0)&&(p486==1))...163
Formula 0 simplified : XG((F!"((p2135==0)||(p1445==1))" R F(!"((p266==0)||(p465==1))" & X!"((p266==0)||(p465==1))")) & XG!"((p1404==0)&&(p486==1))")
Detected timeout of ITS tools.
[2024-05-21 04:04:10] [INFO ] Flatten gal took : 37 ms
[2024-05-21 04:04:10] [INFO ] Applying decomposition
[2024-05-21 04:04:11] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7978750776068303205.txt' '-o' '/tmp/graph7978750776068303205.bin' '-w' '/tmp/graph7978750776068303205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7978750776068303205.bin' '-l' '-1' '-v' '-w' '/tmp/graph7978750776068303205.weights' '-q' '0' '-e' '0.001'
[2024-05-21 04:04:11] [INFO ] Decomposing Gal with order
[2024-05-21 04:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 04:04:11] [INFO ] Removed a total of 514 redundant transitions.
[2024-05-21 04:04:11] [INFO ] Flatten gal took : 208 ms
[2024-05-21 04:04:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 64 ms.
[2024-05-21 04:04:12] [INFO ] Time to serialize gal into /tmp/LTL14479861489894013173.gal : 43 ms
[2024-05-21 04:04:12] [INFO ] Time to serialize properties into /tmp/LTL3763932554803031476.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14479861489894013173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3763932554803031476.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((i34.i1.i0.u514.p2135==0)||(i23.i0.i3.u340.p1445==1))"))U(G(("((i2.u46.p266==0)||(i5.i2.i5.u83.p465==1))")||(X("((i2.u46....255
Formula 0 simplified : XG((F!"((i34.i1.i0.u514.p2135==0)||(i23.i0.i3.u340.p1445==1))" R F(!"((i2.u46.p266==0)||(i5.i2.i5.u83.p465==1))" & X!"((i2.u46.p266=...240
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t263, t298, t378, t451, t500, t670, t699, t752, t783, t861, t1142, t1171, t1224, t...2155
Computing Next relation with stutter on 32080 deadlock states
68 unique states visited
68 strongly connected components in search stack
68 transitions explored
68 items max in DFS search stack
1198 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.1896,447152,1,0,805427,5502,21913,2.16959e+06,549,32053,1727953
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-05 finished in 258090 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 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1526 transition count 1955
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1526 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1526 transition count 1953
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 1517 transition count 1944
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 1517 transition count 1944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 1517 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 1513 transition count 1937
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 1511 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1509 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 1507 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1506 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1506 transition count 1929
Applied a total of 85 rules in 443 ms. Remains 1506 /1546 variables (removed 40) and now considering 1929/1976 (removed 47) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2024-05-21 04:04:27] [INFO ] Computed 3 invariants in 8 ms
[2024-05-21 04:04:27] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 04:04:27] [INFO ] Invariant cache hit.
[2024-05-21 04:04:28] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 04:04:28] [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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1546 places, 1929/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62238 ms. Remains : 1506/1546 places, 1929/1976 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-08
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-08 finished in 62374 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)&&(p1||(p2 U p3)))))'
Support contains 7 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1529 transition count 1958
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1529 transition count 1958
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1529 transition count 1956
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 1521 transition count 1948
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 1521 transition count 1948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 1521 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 1519 transition count 1943
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 1519 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 1517 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 1515 transition count 1939
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 1513 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1512 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1512 transition count 1935
Applied a total of 73 rules in 415 ms. Remains 1512 /1546 variables (removed 34) and now considering 1935/1976 (removed 41) transitions.
// Phase 1: matrix 1935 rows 1512 cols
[2024-05-21 04:05:29] [INFO ] Computed 3 invariants in 15 ms
[2024-05-21 04:05:29] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 04:05:29] [INFO ] Invariant cache hit.
[2024-05-21 04:05:30] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 04:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 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 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 3/3 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1546 places, 1935/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62063 ms. Remains : 1512/1546 places, 1935/1976 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p0)), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-09 finished in 62300 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)))'
Support contains 2 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Graph (trivial) has 1886 edges and 1546 vertex of which 699 / 1546 are part of one of the 63 SCC in 2 ms
Free SCC test removed 636 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1406 edges and 910 vertex of which 902 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 901 transition count 731
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 527 rules applied. Total rules applied 1029 place count 401 transition count 704
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1042 place count 388 transition count 704
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1042 place count 388 transition count 658
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1134 place count 342 transition count 658
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1151 place count 325 transition count 632
Iterating global reduction 3 with 17 rules applied. Total rules applied 1168 place count 325 transition count 632
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1169 place count 325 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1170 place count 324 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1170 place count 324 transition count 630
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1172 place count 323 transition count 630
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1184 place count 311 transition count 613
Iterating global reduction 5 with 12 rules applied. Total rules applied 1196 place count 311 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 1203 place count 311 transition count 606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1204 place count 310 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 308 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 308 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 306 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 306 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 305 transition count 596
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 305 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 304 transition count 594
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 304 transition count 594
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1217 place count 303 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 1218 place count 303 transition count 592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1219 place count 302 transition count 585
Iterating global reduction 7 with 1 rules applied. Total rules applied 1220 place count 302 transition count 585
Performed 141 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1502 place count 161 transition count 364
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1515 place count 161 transition count 351
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1520 place count 156 transition count 345
Iterating global reduction 8 with 5 rules applied. Total rules applied 1525 place count 156 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1526 place count 156 transition count 344
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 1550 place count 144 transition count 330
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1563 place count 144 transition count 317
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1564 place count 143 transition count 315
Iterating global reduction 10 with 1 rules applied. Total rules applied 1565 place count 143 transition count 315
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1599 place count 126 transition count 355
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1622 place count 126 transition count 332
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1631 place count 117 transition count 314
Iterating global reduction 11 with 9 rules applied. Total rules applied 1640 place count 117 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1646 place count 117 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 12 with 39 rules applied. Total rules applied 1685 place count 117 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1686 place count 116 transition count 268
Applied a total of 1686 rules in 100 ms. Remains 116 /1546 variables (removed 1430) and now considering 268/1976 (removed 1708) transitions.
[2024-05-21 04:06:31] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
// Phase 1: matrix 211 rows 116 cols
[2024-05-21 04:06:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 04:06:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 04:06:31] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-21 04:06:31] [INFO ] Invariant cache hit.
[2024-05-21 04:06:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 04:06:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [44, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 165 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1546 places, 268/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 265
Applied a total of 4 rules in 6 ms. Remains 110 /113 variables (removed 3) and now considering 265/268 (removed 3) transitions.
[2024-05-21 04:06:31] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 110 cols
[2024-05-21 04:06:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 04:06:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 04:06:31] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 04:06:31] [INFO ] Invariant cache hit.
[2024-05-21 04:06:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:06:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1546 places, 265/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 110/1546 places, 265/1976 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-12
Stuttering criterion allowed to conclude after 496 steps with 78 reset in 6 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-12 finished in 482 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||X(G((p1||X(G(p2))))))))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1527 transition count 1956
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1527 transition count 1956
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 1527 transition count 1954
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 1517 transition count 1944
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 1517 transition count 1944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 1517 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 1513 transition count 1937
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 1511 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1509 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 1507 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1506 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1506 transition count 1929
Applied a total of 85 rules in 430 ms. Remains 1506 /1546 variables (removed 40) and now considering 1929/1976 (removed 47) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2024-05-21 04:06:32] [INFO ] Computed 3 invariants in 20 ms
[2024-05-21 04:06:32] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 04:06:32] [INFO ] Invariant cache hit.
[2024-05-21 04:06:33] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 04:06:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1546 places, 1929/1976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62160 ms. Remains : 1506/1546 places, 1929/1976 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 422 ms.
Product exploration explored 100000 steps with 50000 reset in 436 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Detected a total of 26/1506 stabilizing places and 28/1929 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-303-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-13 finished in 63292 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((G(p0) U p1))))'
Support contains 4 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Graph (trivial) has 1881 edges and 1546 vertex of which 701 / 1546 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 1403 edges and 908 vertex of which 900 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 899 transition count 732
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 520 rules applied. Total rules applied 1018 place count 403 transition count 708
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1030 place count 391 transition count 708
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1030 place count 391 transition count 661
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1124 place count 344 transition count 661
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1141 place count 327 transition count 635
Iterating global reduction 3 with 17 rules applied. Total rules applied 1158 place count 327 transition count 635
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 327 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1160 place count 326 transition count 634
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1160 place count 326 transition count 633
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1162 place count 325 transition count 633
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1174 place count 313 transition count 616
Iterating global reduction 5 with 12 rules applied. Total rules applied 1186 place count 313 transition count 616
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 1193 place count 313 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1194 place count 312 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 310 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 310 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 308 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 308 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 306 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 306 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 304 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 304 transition count 593
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1212 place count 302 transition count 589
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 302 transition count 589
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 301 transition count 582
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 301 transition count 582
Performed 135 Post agglomeration using F-continuation condition with reduction of 69 identical transitions.
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 7 with 270 rules applied. Total rules applied 1486 place count 166 transition count 378
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1503 place count 166 transition count 361
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1509 place count 160 transition count 350
Iterating global reduction 8 with 6 rules applied. Total rules applied 1515 place count 160 transition count 350
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 1539 place count 148 transition count 336
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1551 place count 148 transition count 324
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1552 place count 147 transition count 322
Iterating global reduction 9 with 1 rules applied. Total rules applied 1553 place count 147 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1554 place count 147 transition count 321
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 1592 place count 128 transition count 356
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1612 place count 128 transition count 336
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1621 place count 119 transition count 318
Iterating global reduction 11 with 9 rules applied. Total rules applied 1630 place count 119 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1635 place count 119 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 12 with 39 rules applied. Total rules applied 1674 place count 119 transition count 274
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 1682 place count 119 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1684 place count 119 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1685 place count 118 transition count 271
Applied a total of 1685 rules in 91 ms. Remains 118 /1546 variables (removed 1428) and now considering 271/1976 (removed 1705) transitions.
[2024-05-21 04:07:35] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-05-21 04:07:35] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 04:07:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 04:07:35] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
[2024-05-21 04:07:35] [INFO ] Invariant cache hit.
[2024-05-21 04:07:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:07:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [42, 43, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 180 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1546 places, 271/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 268
Applied a total of 4 rules in 5 ms. Remains 112 /115 variables (removed 3) and now considering 268/271 (removed 3) transitions.
[2024-05-21 04:07:35] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
// Phase 1: matrix 211 rows 112 cols
[2024-05-21 04:07:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 04:07:35] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 04:07:35] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-21 04:07:35] [INFO ] Invariant cache hit.
[2024-05-21 04:07:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 04:07:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1546 places, 268/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 410 ms. Remains : 112/1546 places, 268/1976 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-14
Product exploration explored 100000 steps with 14520 reset in 138 ms.
Stuttering criterion allowed to conclude after 5890 steps with 881 reset in 11 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-14 finished in 704 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' '!((p0 U !p1))'
Support contains 4 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 1976/1976 transitions.
Graph (trivial) has 1880 edges and 1546 vertex of which 692 / 1546 are part of one of the 63 SCC in 1 ms
Free SCC test removed 629 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1414 edges and 917 vertex of which 909 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 908 transition count 736
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 530 rules applied. Total rules applied 1035 place count 405 transition count 709
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1049 place count 392 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1050 place count 391 transition count 708
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1050 place count 391 transition count 661
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1144 place count 344 transition count 661
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1159 place count 329 transition count 638
Iterating global reduction 4 with 15 rules applied. Total rules applied 1174 place count 329 transition count 638
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1175 place count 329 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1176 place count 328 transition count 637
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1187 place count 317 transition count 622
Iterating global reduction 6 with 11 rules applied. Total rules applied 1198 place count 317 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1204 place count 317 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 315 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 315 transition count 612
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1209 place count 314 transition count 610
Iterating global reduction 7 with 1 rules applied. Total rules applied 1210 place count 314 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1211 place count 313 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 1212 place count 313 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 312 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 312 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 311 transition count 604
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 311 transition count 604
Performed 145 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1506 place count 166 transition count 378
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1522 place count 166 transition count 362
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1528 place count 160 transition count 351
Iterating global reduction 8 with 6 rules applied. Total rules applied 1534 place count 160 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1535 place count 160 transition count 350
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 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 1559 place count 148 transition count 337
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1571 place count 148 transition count 325
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1572 place count 147 transition count 323
Iterating global reduction 10 with 1 rules applied. Total rules applied 1573 place count 147 transition count 323
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1607 place count 130 transition count 360
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1628 place count 130 transition count 339
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1637 place count 121 transition count 321
Iterating global reduction 11 with 9 rules applied. Total rules applied 1646 place count 121 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1652 place count 121 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 12 with 40 rules applied. Total rules applied 1692 place count 121 transition count 275
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1694 place count 121 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1695 place count 120 transition count 274
Applied a total of 1695 rules in 76 ms. Remains 120 /1546 variables (removed 1426) and now considering 274/1976 (removed 1702) transitions.
[2024-05-21 04:07:36] [INFO ] Flow matrix only has 218 transitions (discarded 56 similar events)
// Phase 1: matrix 218 rows 120 cols
[2024-05-21 04:07:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:07:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 04:07:36] [INFO ] Flow matrix only has 218 transitions (discarded 56 similar events)
[2024-05-21 04:07:36] [INFO ] Invariant cache hit.
[2024-05-21 04:07:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 04:07:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [47, 48, 83]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 164 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1546 places, 274/1976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 271
Applied a total of 4 rules in 4 ms. Remains 114 /117 variables (removed 3) and now considering 271/274 (removed 3) transitions.
[2024-05-21 04:07:36] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
// Phase 1: matrix 215 rows 114 cols
[2024-05-21 04:07:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:07:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 04:07:36] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
[2024-05-21 04:07:36] [INFO ] Invariant cache hit.
[2024-05-21 04:07:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:07:36] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1546 places, 271/1976 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 114/1546 places, 271/1976 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, p1]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLCardinality-15 finished in 465 ms.
All properties solved by simple procedures.
Total runtime 589097 ms.

BK_STOP 1716264456535

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-303"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-303, 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 r092-tall-171624188600131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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