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.r003-smll-171620117000124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117000124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 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 757K 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 ASLink-PT-08a-LTLFireability-00
FORMULA_NAME ASLink-PT-08a-LTLFireability-01
FORMULA_NAME ASLink-PT-08a-LTLFireability-02
FORMULA_NAME ASLink-PT-08a-LTLFireability-03
FORMULA_NAME ASLink-PT-08a-LTLFireability-04
FORMULA_NAME ASLink-PT-08a-LTLFireability-05
FORMULA_NAME ASLink-PT-08a-LTLFireability-06
FORMULA_NAME ASLink-PT-08a-LTLFireability-07
FORMULA_NAME ASLink-PT-08a-LTLFireability-08
FORMULA_NAME ASLink-PT-08a-LTLFireability-09
FORMULA_NAME ASLink-PT-08a-LTLFireability-10
FORMULA_NAME ASLink-PT-08a-LTLFireability-11
FORMULA_NAME ASLink-PT-08a-LTLFireability-12
FORMULA_NAME ASLink-PT-08a-LTLFireability-13
FORMULA_NAME ASLink-PT-08a-LTLFireability-14
FORMULA_NAME ASLink-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716347573565

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:12:56] [INFO ] Load time of PNML (sax parser for PT used): 398 ms
[2024-05-22 03:12:56] [INFO ] Transformed 1796 places.
[2024-05-22 03:12:56] [INFO ] Transformed 2646 transitions.
[2024-05-22 03:12:56] [INFO ] Found NUPN structural information;
[2024-05-22 03:12:56] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1736 transition count 2563
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1735 transition count 2563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 1735 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1734 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1734 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1733 transition count 2545
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1733 transition count 2545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1732 transition count 2537
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1732 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1731 transition count 2529
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1731 transition count 2529
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1730 transition count 2521
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1730 transition count 2521
Applied a total of 85 rules in 1276 ms. Remains 1730 /1796 variables (removed 66) and now considering 2521/2618 (removed 97) transitions.
// Phase 1: matrix 2521 rows 1730 cols
[2024-05-22 03:12:58] [INFO ] Computed 297 invariants in 173 ms
[2024-05-22 03:13:00] [INFO ] Implicit Places using invariants in 2799 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1368, 1386, 1515, 1520, 1532, 1537, 1538, 1539, 1568, 1573, 1591, 1592, 1593, 1594, 1611, 1619, 1627, 1633, 1639, 1645, 1651, 1659, 1665, 1671, 1679]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 2865 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1652/1796 places, 2521/2618 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1640 transition count 2509
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1640 transition count 2509
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1632 transition count 2501
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1632 transition count 2501
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1628 transition count 2497
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1628 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1627 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1627 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1626 transition count 2495
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1626 transition count 2495
Applied a total of 52 rules in 652 ms. Remains 1626 /1652 variables (removed 26) and now considering 2495/2521 (removed 26) transitions.
// Phase 1: matrix 2495 rows 1626 cols
[2024-05-22 03:13:01] [INFO ] Computed 219 invariants in 87 ms
[2024-05-22 03:13:03] [INFO ] Implicit Places using invariants in 1950 ms returned []
[2024-05-22 03:13:03] [INFO ] Invariant cache hit.
[2024-05-22 03:13:10] [INFO ] Implicit Places using invariants and state equation in 7427 ms returned []
Implicit Place search using SMT with State Equation took 9383 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1626/1796 places, 2495/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14210 ms. Remains : 1626/1796 places, 2495/2618 transitions.
Support contains 51 out of 1626 places after structural reductions.
[2024-05-22 03:13:11] [INFO ] Flatten gal took : 457 ms
[2024-05-22 03:13:11] [INFO ] Flatten gal took : 176 ms
[2024-05-22 03:13:12] [INFO ] Input system was already deterministic with 2495 transitions.
RANDOM walk for 40000 steps (187 resets) in 2886 ms. (13 steps per ms) remains 20/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2024-05-22 03:13:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 425/470 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 304/774 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 851/1625 variables, 163/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/1626 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1626 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4121/4121 variables, and 1845 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1626/1626 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 425/470 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 304/774 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 851/1625 variables, 163/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/1626 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1626 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 10199ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 1626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 1626 transition count 2195
Reduce places removed 300 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 309 rules applied. Total rules applied 609 place count 1326 transition count 2186
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 618 place count 1317 transition count 2186
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 618 place count 1317 transition count 1971
Deduced a syphon composed of 215 places in 4 ms
Ensure Unique test removed 69 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 3 with 499 rules applied. Total rules applied 1117 place count 1033 transition count 1971
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 1133 place count 1022 transition count 1966
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1138 place count 1017 transition count 1966
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 1138 place count 1017 transition count 1934
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1202 place count 985 transition count 1934
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1208 place count 979 transition count 1928
Iterating global reduction 5 with 6 rules applied. Total rules applied 1214 place count 979 transition count 1928
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 1 rules applied. Total rules applied 1215 place count 979 transition count 1927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1216 place count 978 transition count 1927
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1216 place count 978 transition count 1926
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1218 place count 977 transition count 1926
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1222 place count 973 transition count 1922
Iterating global reduction 7 with 4 rules applied. Total rules applied 1226 place count 973 transition count 1922
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1229 place count 973 transition count 1919
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 8 with 161 rules applied. Total rules applied 1390 place count 892 transition count 1839
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1392 place count 890 transition count 1837
Iterating global reduction 8 with 2 rules applied. Total rules applied 1394 place count 890 transition count 1837
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1394 place count 890 transition count 1836
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1396 place count 889 transition count 1836
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1405 place count 889 transition count 1827
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1414 place count 880 transition count 1827
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1444 place count 880 transition count 1797
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 1474 place count 850 transition count 1797
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1479 place count 850 transition count 1792
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1500 place count 850 transition count 1792
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1503 place count 850 transition count 1792
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 850 transition count 1791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1505 place count 849 transition count 1790
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1513 place count 841 transition count 1790
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 1513 place count 841 transition count 1775
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 35 rules applied. Total rules applied 1548 place count 821 transition count 1775
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 1550 place count 820 transition count 1774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1551 place count 819 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1556 place count 814 transition count 1769
Iterating global reduction 13 with 5 rules applied. Total rules applied 1561 place count 814 transition count 1769
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1566 place count 814 transition count 1764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1568 place count 813 transition count 1763
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1569 place count 813 transition count 1762
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1571 place count 813 transition count 1760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1573 place count 811 transition count 1760
Applied a total of 1573 rules in 1427 ms. Remains 811 /1626 variables (removed 815) and now considering 1760/2495 (removed 735) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1428 ms. Remains : 811/1626 places, 1760/2495 transitions.
RANDOM walk for 40000 steps (611 resets) in 1192 ms. (33 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
// Phase 1: matrix 1760 rows 811 cols
[2024-05-22 03:13:25] [INFO ] Computed 124 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 83/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 446/574 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 56/630 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 5/635 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/635 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 148/783 variables, 35/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/784 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/784 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 27/811 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 1760/2571 variables, 811/935 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2571 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/2571 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2571/2571 variables, and 935 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6348 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 83/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 446/574 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 56/630 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 5/635 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/635 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 148/783 variables, 35/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/784 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/784 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 27/811 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 17 (OVERLAPS) 1760/2571 variables, 811/935 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2571 variables, 9/944 constraints. Problems are: Problem set: 9 solved, 9 unsolved
[2024-05-22 03:14:01] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 36 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2571 variables, 1/945 constraints. Problems are: Problem set: 9 solved, 9 unsolved
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2571 variables, 1/946 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2571 variables, 0/946 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/2571 variables, 0/946 constraints. Problems are: Problem set: 9 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2571/2571 variables, and 946 constraints, problems are : Problem set: 9 solved, 9 unsolved in 43009 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 811/811 constraints, PredecessorRefiner: 9/18 constraints, Known Traps: 2/2 constraints]
After SMT, in 49458ms problems are : Problem set: 9 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 7 properties in 23919 ms.
Support contains 5 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 1760/1760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 811 transition count 1759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 810 transition count 1759
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 807 transition count 1744
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 807 transition count 1744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 806 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 805 transition count 1735
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 805 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 804 transition count 1727
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 804 transition count 1727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 803 transition count 1719
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 803 transition count 1719
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 802 transition count 1711
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 802 transition count 1711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 801 transition count 1703
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 801 transition count 1703
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 800 transition count 1695
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 800 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 799 transition count 1687
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 799 transition count 1687
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 798 transition count 1679
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 798 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 797 transition count 1671
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 797 transition count 1671
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 796 transition count 1663
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 796 transition count 1663
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 789 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 787 transition count 1656
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 787 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 787 transition count 1655
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 787 transition count 1654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 49 place count 786 transition count 1654
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 786 transition count 1653
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 786 transition count 1652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 785 transition count 1652
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 58 place count 785 transition count 1652
Applied a total of 58 rules in 617 ms. Remains 785 /811 variables (removed 26) and now considering 1652/1760 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 785/811 places, 1652/1760 transitions.
RANDOM walk for 40000 steps (587 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 249183 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :1 out of 2
Probabilistic random walk after 249183 steps, saw 72482 distinct states, run finished after 3018 ms. (steps per millisecond=82 ) properties seen :1
// Phase 1: matrix 1652 rows 785 cols
[2024-05-22 03:14:42] [INFO ] Computed 121 invariants in 33 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/236 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/242 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/243 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/337 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/339 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 79/418 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/419 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 92/511 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/513 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 82/595 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/595 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/599 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/599 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 49/648 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/648 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 16/664 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 88/752 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/752 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/774 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/774 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 11/785 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/785 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1652/2437 variables, 785/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2437 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/2437 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 785/785 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/236 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/242 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/243 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/337 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/339 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 79/418 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/419 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 92/511 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/513 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/513 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 82/595 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/595 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/599 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/599 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 49/648 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/648 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 16/664 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 88/752 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/752 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/774 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/774 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 11/785 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/785 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1652/2437 variables, 785/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2437 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2437 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/2437 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 907 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4416 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 785/785 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6336ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 92624 steps, including 1353 resets, run visited all 1 properties in 291 ms. (steps per millisecond=318 )
Parikh walk visited 1 properties in 297 ms.
FORMULA ASLink-PT-08a-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-08a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1625 transition count 2180
Reduce places removed 322 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 329 rules applied. Total rules applied 643 place count 1303 transition count 2173
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 650 place count 1296 transition count 2173
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 650 place count 1296 transition count 1941
Deduced a syphon composed of 232 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1183 place count 995 transition count 1941
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1228 place count 975 transition count 1916
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1253 place count 950 transition count 1916
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1253 place count 950 transition count 1883
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1319 place count 917 transition count 1883
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1334 place count 902 transition count 1856
Iterating global reduction 5 with 15 rules applied. Total rules applied 1349 place count 902 transition count 1856
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 12 rules applied. Total rules applied 1361 place count 901 transition count 1845
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1361 place count 901 transition count 1844
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1363 place count 900 transition count 1844
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1365 place count 898 transition count 1835
Iterating global reduction 6 with 2 rules applied. Total rules applied 1367 place count 898 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 897 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 896 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 896 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 895 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 895 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 894 transition count 1803
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 894 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 893 transition count 1795
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 892 transition count 1787
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 891 transition count 1779
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 890 transition count 1771
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 889 transition count 1763
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1763
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 6 with 161 rules applied. Total rules applied 1546 place count 808 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1548 place count 806 transition count 1681
Iterating global reduction 6 with 2 rules applied. Total rules applied 1550 place count 806 transition count 1681
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1550 place count 806 transition count 1680
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1552 place count 805 transition count 1680
Applied a total of 1552 rules in 551 ms. Remains 805 /1626 variables (removed 821) and now considering 1680/2495 (removed 815) transitions.
// Phase 1: matrix 1680 rows 805 cols
[2024-05-22 03:14:50] [INFO ] Computed 120 invariants in 19 ms
[2024-05-22 03:14:51] [INFO ] Implicit Places using invariants in 1086 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 802]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1091 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 764/1626 places, 1680/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 764 transition count 1675
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 759 transition count 1675
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 743 transition count 1659
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 743 transition count 1659
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 727 transition count 1643
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 727 transition count 1643
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 719 transition count 1635
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 719 transition count 1635
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 702 transition count 1618
Applied a total of 124 rules in 211 ms. Remains 702 /764 variables (removed 62) and now considering 1618/1680 (removed 62) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-05-22 03:14:51] [INFO ] Computed 79 invariants in 32 ms
[2024-05-22 03:14:52] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-22 03:14:52] [INFO ] Invariant cache hit.
[2024-05-22 03:14:55] [INFO ] Implicit Places using invariants and state equation in 3200 ms returned []
Implicit Place search using SMT with State Equation took 4411 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 702/1626 places, 1618/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6267 ms. Remains : 702/1626 places, 1618/2495 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-00
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-00 finished in 6789 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((p0||X(F((p0&&F(!p0))))))))'
Support contains 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 1106 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-05-22 03:14:57] [INFO ] Computed 219 invariants in 42 ms
[2024-05-22 03:14:59] [INFO ] Implicit Places using invariants in 2136 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2141 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 109 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3356 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 252 ms :[p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-03
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 7 ms.
FORMULA ASLink-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-03 finished in 3655 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&&X(p1))))'
Support contains 4 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1623 transition count 2480
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1623 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1621 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1621 transition count 2471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1619 transition count 2462
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1619 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2453
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2444
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2435
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2426
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1610 transition count 2418
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1610 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1609 transition count 2410
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1609 transition count 2410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2394
Applied a total of 38 rules in 1238 ms. Remains 1607 /1626 variables (removed 19) and now considering 2394/2495 (removed 101) transitions.
// Phase 1: matrix 2394 rows 1607 cols
[2024-05-22 03:15:01] [INFO ] Computed 219 invariants in 40 ms
[2024-05-22 03:15:03] [INFO ] Implicit Places using invariants in 2059 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2070 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1606/1626 places, 2394/2495 transitions.
Applied a total of 0 rules in 115 ms. Remains 1606 /1606 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3424 ms. Remains : 1606/1626 places, 2394/2495 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1883 ms.
Product exploration explored 100000 steps with 50000 reset in 1517 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-04 finished in 7171 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)||p0)))'
Support contains 3 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 995 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-05-22 03:15:08] [INFO ] Computed 219 invariants in 25 ms
[2024-05-22 03:15:09] [INFO ] Implicit Places using invariants in 1810 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1813 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 107 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2916 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1424 ms.
Product exploration explored 100000 steps with 50000 reset in 1192 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-06 finished in 5782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1232 place count 973 transition count 1914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1339 place count 899 transition count 1853
Iterating global reduction 5 with 16 rules applied. Total rules applied 1355 place count 899 transition count 1853
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 13 rules applied. Total rules applied 1368 place count 898 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1369 place count 897 transition count 1840
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1371 place count 896 transition count 1840
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1373 place count 894 transition count 1831
Iterating global reduction 7 with 2 rules applied. Total rules applied 1375 place count 894 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 893 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 892 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 891 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 890 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 889 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 888 transition count 1783
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 888 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 887 transition count 1775
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 887 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 886 transition count 1767
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 886 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 885 transition count 1759
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 885 transition count 1759
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 159 rules applied. Total rules applied 1552 place count 805 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1555 place count 802 transition count 1677
Iterating global reduction 7 with 3 rules applied. Total rules applied 1558 place count 802 transition count 1677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1558 place count 802 transition count 1676
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1560 place count 801 transition count 1676
Applied a total of 1560 rules in 750 ms. Remains 801 /1626 variables (removed 825) and now considering 1676/2495 (removed 819) transitions.
// Phase 1: matrix 1676 rows 801 cols
[2024-05-22 03:15:13] [INFO ] Computed 120 invariants in 18 ms
[2024-05-22 03:15:14] [INFO ] Implicit Places using invariants in 1079 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 798]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/1626 places, 1676/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 760 transition count 1671
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 715 transition count 1631
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 698 transition count 1614
Applied a total of 124 rules in 145 ms. Remains 698 /760 variables (removed 62) and now considering 1614/1676 (removed 62) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2024-05-22 03:15:14] [INFO ] Computed 79 invariants in 24 ms
[2024-05-22 03:15:15] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2024-05-22 03:15:15] [INFO ] Invariant cache hit.
[2024-05-22 03:15:18] [INFO ] Implicit Places using invariants and state equation in 2894 ms returned []
Implicit Place search using SMT with State Equation took 3926 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 698/1626 places, 1614/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5906 ms. Remains : 698/1626 places, 1614/2495 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-07
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-07 finished in 6025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1232 place count 973 transition count 1914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1339 place count 899 transition count 1853
Iterating global reduction 5 with 16 rules applied. Total rules applied 1355 place count 899 transition count 1853
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 13 rules applied. Total rules applied 1368 place count 898 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1369 place count 897 transition count 1840
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1371 place count 896 transition count 1840
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1373 place count 894 transition count 1831
Iterating global reduction 7 with 2 rules applied. Total rules applied 1375 place count 894 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 893 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 892 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 891 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 890 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 889 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 888 transition count 1783
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 888 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 887 transition count 1775
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 887 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 886 transition count 1767
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 886 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 885 transition count 1759
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 885 transition count 1759
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 159 rules applied. Total rules applied 1552 place count 805 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1555 place count 802 transition count 1677
Iterating global reduction 7 with 3 rules applied. Total rules applied 1558 place count 802 transition count 1677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1558 place count 802 transition count 1676
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1560 place count 801 transition count 1676
Applied a total of 1560 rules in 613 ms. Remains 801 /1626 variables (removed 825) and now considering 1676/2495 (removed 819) transitions.
// Phase 1: matrix 1676 rows 801 cols
[2024-05-22 03:15:19] [INFO ] Computed 120 invariants in 37 ms
[2024-05-22 03:15:20] [INFO ] Implicit Places using invariants in 1414 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 798]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1417 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/1626 places, 1676/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 760 transition count 1671
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 715 transition count 1631
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 698 transition count 1614
Applied a total of 124 rules in 169 ms. Remains 698 /760 variables (removed 62) and now considering 1614/1676 (removed 62) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2024-05-22 03:15:21] [INFO ] Computed 79 invariants in 26 ms
[2024-05-22 03:15:22] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-22 03:15:22] [INFO ] Invariant cache hit.
[2024-05-22 03:15:25] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4519 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 698/1626 places, 1614/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6720 ms. Remains : 698/1626 places, 1614/2495 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-09
Product exploration explored 100000 steps with 1262 reset in 537 ms.
Product exploration explored 100000 steps with 1262 reset in 612 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (526 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4674 steps, run visited all 1 properties in 23 ms. (steps per millisecond=203 )
Probabilistic random walk after 4674 steps, saw 4531 distinct states, run finished after 37 ms. (steps per millisecond=126 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1614/1614 transitions.
Applied a total of 0 rules in 33 ms. Remains 698 /698 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-22 03:15:27] [INFO ] Invariant cache hit.
[2024-05-22 03:15:28] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-05-22 03:15:28] [INFO ] Invariant cache hit.
[2024-05-22 03:15:32] [INFO ] Implicit Places using invariants and state equation in 3539 ms returned []
Implicit Place search using SMT with State Equation took 4855 ms to find 0 implicit places.
[2024-05-22 03:15:32] [INFO ] Redundant transitions in 224 ms returned []
Running 1568 sub problems to find dead transitions.
[2024-05-22 03:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1568 unsolved
SMT process timed out in 31599ms, After SMT, problems are : Problem set: 0 solved, 1568 unsolved
Search for dead transitions found 0 dead transitions in 31646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36786 ms. Remains : 698/698 places, 1614/1614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (502 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (84 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4674 steps, run visited all 1 properties in 25 ms. (steps per millisecond=186 )
Probabilistic random walk after 4674 steps, saw 4531 distinct states, run finished after 25 ms. (steps per millisecond=186 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1292 reset in 319 ms.
Product exploration explored 100000 steps with 1275 reset in 327 ms.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1614/1614 transitions.
Applied a total of 0 rules in 45 ms. Remains 698 /698 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-22 03:16:05] [INFO ] Invariant cache hit.
[2024-05-22 03:16:06] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-05-22 03:16:06] [INFO ] Invariant cache hit.
[2024-05-22 03:16:09] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2024-05-22 03:16:09] [INFO ] Redundant transitions in 186 ms returned []
Running 1568 sub problems to find dead transitions.
[2024-05-22 03:16:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1568 unsolved
SMT process timed out in 31299ms, After SMT, problems are : Problem set: 0 solved, 1568 unsolved
Search for dead transitions found 0 dead transitions in 31333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35456 ms. Remains : 698/698 places, 1614/1614 transitions.
Treatment of property ASLink-PT-08a-LTLFireability-09 finished in 82568 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 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 832 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-05-22 03:16:42] [INFO ] Computed 219 invariants in 43 ms
[2024-05-22 03:16:44] [INFO ] Implicit Places using invariants in 1852 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1856 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 106 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2796 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-10 finished in 2990 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 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 4 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 44 rules applied. Total rules applied 1231 place count 973 transition count 1915
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 25 rules applied. Total rules applied 1256 place count 949 transition count 1914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1338 place count 900 transition count 1854
Iterating global reduction 6 with 15 rules applied. Total rules applied 1353 place count 900 transition count 1854
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 6 with 12 rules applied. Total rules applied 1365 place count 899 transition count 1843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1366 place count 898 transition count 1843
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1366 place count 898 transition count 1842
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1368 place count 897 transition count 1842
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1370 place count 895 transition count 1833
Iterating global reduction 8 with 2 rules applied. Total rules applied 1372 place count 895 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1373 place count 894 transition count 1825
Iterating global reduction 8 with 1 rules applied. Total rules applied 1374 place count 894 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1375 place count 893 transition count 1817
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 893 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1377 place count 892 transition count 1809
Iterating global reduction 8 with 1 rules applied. Total rules applied 1378 place count 892 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 891 transition count 1801
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 891 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1381 place count 890 transition count 1793
Iterating global reduction 8 with 1 rules applied. Total rules applied 1382 place count 890 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1383 place count 889 transition count 1785
Iterating global reduction 8 with 1 rules applied. Total rules applied 1384 place count 889 transition count 1785
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1385 place count 888 transition count 1777
Iterating global reduction 8 with 1 rules applied. Total rules applied 1386 place count 888 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1387 place count 887 transition count 1769
Iterating global reduction 8 with 1 rules applied. Total rules applied 1388 place count 887 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1389 place count 886 transition count 1761
Iterating global reduction 8 with 1 rules applied. Total rules applied 1390 place count 886 transition count 1761
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 157 rules applied. Total rules applied 1547 place count 807 transition count 1683
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1550 place count 804 transition count 1680
Iterating global reduction 8 with 3 rules applied. Total rules applied 1553 place count 804 transition count 1680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1553 place count 804 transition count 1679
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1555 place count 803 transition count 1679
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1557 place count 803 transition count 1679
Applied a total of 1557 rules in 755 ms. Remains 803 /1626 variables (removed 823) and now considering 1679/2495 (removed 816) transitions.
// Phase 1: matrix 1679 rows 803 cols
[2024-05-22 03:16:45] [INFO ] Computed 120 invariants in 17 ms
[2024-05-22 03:16:46] [INFO ] Implicit Places using invariants in 1492 ms returned [72, 89, 95, 100, 108, 183, 189, 194, 197, 257, 274, 280, 285, 287, 347, 364, 370, 375, 377, 437, 454, 460, 465, 467, 527, 544, 550, 555, 557, 617, 634, 640, 645, 647, 707, 724, 730, 735, 737, 800]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/1626 places, 1679/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 763 transition count 1674
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 758 transition count 1674
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 742 transition count 1658
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 742 transition count 1658
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 726 transition count 1642
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 726 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 718 transition count 1634
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 718 transition count 1634
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 122 place count 702 transition count 1618
Applied a total of 122 rules in 189 ms. Remains 702 /763 variables (removed 61) and now considering 1618/1679 (removed 61) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-05-22 03:16:46] [INFO ] Computed 80 invariants in 24 ms
[2024-05-22 03:16:48] [INFO ] Implicit Places using invariants in 1436 ms returned []
[2024-05-22 03:16:48] [INFO ] Invariant cache hit.
[2024-05-22 03:16:51] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 4654 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 702/1626 places, 1618/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7094 ms. Remains : 702/1626 places, 1618/2495 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 1304 reset in 434 ms.
Product exploration explored 100000 steps with 1270 reset in 480 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (537 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203150 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203150 steps, saw 135480 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-22 03:16:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3317ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 647 transition count 1555
Applied a total of 119 rules in 131 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (675 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194880 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194880 steps, saw 110072 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2024-05-22 03:17:02] [INFO ] Computed 80 invariants in 16 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5578ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8085 steps, including 994 resets, run visited all 1 properties in 35 ms. (steps per millisecond=231 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-05-22 03:17:08] [INFO ] Computed 80 invariants in 20 ms
[2024-05-22 03:17:09] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2024-05-22 03:17:09] [INFO ] Invariant cache hit.
[2024-05-22 03:17:12] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4203 ms to find 0 implicit places.
[2024-05-22 03:17:12] [INFO ] Redundant transitions in 84 ms returned []
Running 1572 sub problems to find dead transitions.
[2024-05-22 03:17:12] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
SMT process timed out in 31386ms, After SMT, problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 31421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35752 ms. Remains : 702/702 places, 1618/1618 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (518 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206694 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206694 steps, saw 136888 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-22 03:17:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1618/2320 variables, 702/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 647 transition count 1555
Applied a total of 119 rules in 185 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (681 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (122 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180446 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 180446 steps, saw 104971 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2024-05-22 03:17:54] [INFO ] Computed 80 invariants in 24 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4348 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5727ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7235 steps, including 988 resets, run visited all 1 properties in 20 ms. (steps per millisecond=361 )
Parikh walk visited 1 properties in 20 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1302 reset in 462 ms.
Product exploration explored 100000 steps with 1271 reset in 485 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 46 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-05-22 03:18:01] [INFO ] Computed 80 invariants in 26 ms
[2024-05-22 03:18:03] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-05-22 03:18:03] [INFO ] Invariant cache hit.
[2024-05-22 03:18:06] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 4427 ms to find 0 implicit places.
[2024-05-22 03:18:06] [INFO ] Redundant transitions in 69 ms returned []
Running 1572 sub problems to find dead transitions.
[2024-05-22 03:18:06] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
SMT process timed out in 31603ms, After SMT, problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 31636ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36202 ms. Remains : 702/702 places, 1618/1618 transitions.
Treatment of property ASLink-PT-08a-LTLFireability-13 finished in 113546 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(X(X(p0)))))'
Support contains 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 1327 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-05-22 03:18:39] [INFO ] Computed 219 invariants in 40 ms
[2024-05-22 03:18:41] [INFO ] Implicit Places using invariants in 2017 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2031 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 105 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3464 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-15 finished in 3779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)))'
[2024-05-22 03:18:42] [INFO ] Flatten gal took : 284 ms
[2024-05-22 03:18:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-22 03:18:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1626 places, 2495 transitions and 8719 arcs took 46 ms.
Total runtime 347198 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-08a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1626
TRANSITIONS: 2495
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.105s, Sys 0.013s]


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


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

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

Process ID: 1078
MODEL NAME: /home/mcc/execution/405/model
1626 places, 2495 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ASLink-PT-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-08a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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