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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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:22 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 516K 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-05a-LTLCardinality-00
FORMULA_NAME ASLink-PT-05a-LTLCardinality-01
FORMULA_NAME ASLink-PT-05a-LTLCardinality-02
FORMULA_NAME ASLink-PT-05a-LTLCardinality-03
FORMULA_NAME ASLink-PT-05a-LTLCardinality-04
FORMULA_NAME ASLink-PT-05a-LTLCardinality-05
FORMULA_NAME ASLink-PT-05a-LTLCardinality-06
FORMULA_NAME ASLink-PT-05a-LTLCardinality-07
FORMULA_NAME ASLink-PT-05a-LTLCardinality-08
FORMULA_NAME ASLink-PT-05a-LTLCardinality-09
FORMULA_NAME ASLink-PT-05a-LTLCardinality-10
FORMULA_NAME ASLink-PT-05a-LTLCardinality-11
FORMULA_NAME ASLink-PT-05a-LTLCardinality-12
FORMULA_NAME ASLink-PT-05a-LTLCardinality-13
FORMULA_NAME ASLink-PT-05a-LTLCardinality-14
FORMULA_NAME ASLink-PT-05a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717198216349

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:30:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:30:18] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-31 23:30:18] [INFO ] Transformed 1211 places.
[2024-05-31 23:30:18] [INFO ] Transformed 1827 transitions.
[2024-05-31 23:30:18] [INFO ] Found NUPN structural information;
[2024-05-31 23:30:18] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 1174 transition count 1783
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 1173 transition count 1783
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 1173 transition count 1781
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 1172 transition count 1773
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1172 transition count 1773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1171 transition count 1765
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1171 transition count 1765
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1170 transition count 1757
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1170 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1749
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1749
Applied a total of 55 rules in 700 ms. Remains 1169 /1211 variables (removed 42) and now considering 1749/1808 (removed 59) transitions.
// Phase 1: matrix 1749 rows 1169 cols
[2024-05-31 23:30:19] [INFO ] Computed 201 invariants in 181 ms
[2024-05-31 23:30:21] [INFO ] Implicit Places using invariants in 1776 ms returned [1, 19, 20, 23, 52, 70, 199, 215, 220, 221, 222, 240, 258, 388, 404, 408, 409, 410, 428, 446, 575, 591, 596, 597, 617, 635, 764, 785, 786, 806, 824, 953, 958, 970, 975, 976, 977, 1007, 1012, 1030, 1031, 1032, 1033, 1050, 1058, 1066, 1072, 1078, 1084, 1090, 1098, 1104, 1110, 1118]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1850 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1211 places, 1749/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1102 transition count 1736
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1102 transition count 1736
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1092 transition count 1726
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1092 transition count 1726
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1087 transition count 1721
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1087 transition count 1721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1085 transition count 1719
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1085 transition count 1719
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1083 transition count 1717
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1083 transition count 1717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1082 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1082 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1081 transition count 1715
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1081 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1080 transition count 1714
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1080 transition count 1714
Applied a total of 70 rules in 681 ms. Remains 1080 /1115 variables (removed 35) and now considering 1714/1749 (removed 35) transitions.
// Phase 1: matrix 1714 rows 1080 cols
[2024-05-31 23:30:22] [INFO ] Computed 147 invariants in 77 ms
[2024-05-31 23:30:23] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-05-31 23:30:23] [INFO ] Invariant cache hit.
[2024-05-31 23:30:28] [INFO ] Implicit Places using invariants and state equation in 4843 ms returned []
Implicit Place search using SMT with State Equation took 5881 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1080/1211 places, 1714/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9143 ms. Remains : 1080/1211 places, 1714/1808 transitions.
Support contains 34 out of 1080 places after structural reductions.
[2024-05-31 23:30:28] [INFO ] Flatten gal took : 240 ms
[2024-05-31 23:30:28] [INFO ] Flatten gal took : 137 ms
[2024-05-31 23:30:29] [INFO ] Input system was already deterministic with 1714 transitions.
Support contains 32 out of 1080 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (262 resets) in 2207 ms. (18 steps per ms) remains 8/18 properties
BEST_FIRST walk for 40003 steps (36 resets) in 401 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (38 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
[2024-05-31 23:30:30] [INFO ] Invariant cache hit.
Problem AtomicPropp16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 158/171 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 291/462 variables, 18/30 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 564/1026 variables, 99/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 54/1080 variables, 18/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1080 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1714/2794 variables, 1080/1227 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2794 variables, 0/1227 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2794 variables, 0/1227 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2794/2794 variables, and 1227 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2213 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1080/1080 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 98/109 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 353/462 variables, 23/30 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 23:30:32] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 564/1026 variables, 99/130 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 23:30:33] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 6 ms to minimize.
[2024-05-31 23:30:33] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1026 variables, 2/132 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 54/1080 variables, 18/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1714/2794 variables, 1080/1230 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2794 variables, 7/1237 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2794/2794 variables, and 1237 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1080/1080 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 7289ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 1080 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1080 transition count 1530
Reduce places removed 184 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 185 rules applied. Total rules applied 369 place count 896 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 370 place count 895 transition count 1529
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 370 place count 895 transition count 1388
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 697 place count 709 transition count 1388
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 712 place count 703 transition count 1379
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 721 place count 694 transition count 1379
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 721 place count 694 transition count 1359
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 761 place count 674 transition count 1359
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 766 place count 669 transition count 1347
Iterating global reduction 5 with 5 rules applied. Total rules applied 771 place count 669 transition count 1347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 775 place count 669 transition count 1343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 776 place count 668 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 777 place count 667 transition count 1335
Iterating global reduction 7 with 1 rules applied. Total rules applied 778 place count 667 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 779 place count 666 transition count 1327
Iterating global reduction 7 with 1 rules applied. Total rules applied 780 place count 666 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 781 place count 665 transition count 1319
Iterating global reduction 7 with 1 rules applied. Total rules applied 782 place count 665 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 783 place count 664 transition count 1311
Iterating global reduction 7 with 1 rules applied. Total rules applied 784 place count 664 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 785 place count 663 transition count 1303
Iterating global reduction 7 with 1 rules applied. Total rules applied 786 place count 663 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 787 place count 662 transition count 1295
Iterating global reduction 7 with 1 rules applied. Total rules applied 788 place count 662 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 789 place count 661 transition count 1287
Iterating global reduction 7 with 1 rules applied. Total rules applied 790 place count 661 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 791 place count 660 transition count 1279
Iterating global reduction 7 with 1 rules applied. Total rules applied 792 place count 660 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 659 transition count 1271
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 659 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 658 transition count 1263
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 658 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 657 transition count 1255
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 657 transition count 1255
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 107 rules applied. Total rules applied 905 place count 603 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 906 place count 602 transition count 1201
Iterating global reduction 7 with 1 rules applied. Total rules applied 907 place count 602 transition count 1201
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 909 place count 602 transition count 1199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 911 place count 600 transition count 1199
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 928 place count 600 transition count 1182
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 946 place count 582 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 948 place count 582 transition count 1180
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 964 place count 582 transition count 1180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 965 place count 581 transition count 1179
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 971 place count 575 transition count 1179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 971 place count 575 transition count 1168
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 27 rules applied. Total rules applied 998 place count 559 transition count 1168
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1003 place count 554 transition count 1163
Iterating global reduction 10 with 5 rules applied. Total rules applied 1008 place count 554 transition count 1163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1013 place count 554 transition count 1158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1019 place count 551 transition count 1155
Applied a total of 1019 rules in 1023 ms. Remains 551 /1080 variables (removed 529) and now considering 1155/1714 (removed 559) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 551/1080 places, 1155/1714 transitions.
RANDOM walk for 40000 steps (608 resets) in 725 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (147 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (139 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (145 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (150 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (144 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (144 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (156 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 167546 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :2 out of 7
Probabilistic random walk after 167546 steps, saw 87485 distinct states, run finished after 3006 ms. (steps per millisecond=55 ) properties seen :2
// Phase 1: matrix 1155 rows 551 cols
[2024-05-31 23:30:42] [INFO ] Computed 83 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 193/245 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 26/271 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 241/512 variables, 46/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/513 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 38/551 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1155/1706 variables, 551/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1706 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1706 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1706/1706 variables, and 634 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 193/245 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 26/271 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 241/512 variables, 46/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:30:43] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 4 ms to minimize.
[2024-05-31 23:30:44] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/513 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 38/551 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:30:44] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1155/1706 variables, 551/637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1706 variables, 5/642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-05-31 23:30:56] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1706 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1706 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1706 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1706/1706 variables, and 644 constraints, problems are : Problem set: 0 solved, 5 unsolved in 14416 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 15511ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 19562 ms.
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1155/1155 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 551 transition count 1152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 548 transition count 1152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 548 transition count 1151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 547 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 546 transition count 1145
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 546 transition count 1145
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 545 transition count 1145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 544 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 543 transition count 1143
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 543 transition count 1143
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 543 transition count 1142
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 542 transition count 1141
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 542 transition count 1141
Applied a total of 20 rules in 161 ms. Remains 542 /551 variables (removed 9) and now considering 1141/1155 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 542/551 places, 1141/1155 transitions.
RANDOM walk for 40000 steps (602 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (149 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (148 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184202 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184202 steps, saw 94839 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 1141 rows 542 cols
[2024-05-31 23:31:20] [INFO ] Computed 82 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/111 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/142 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/342 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/371 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 150/521 variables, 27/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/522 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/542 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1141/1683 variables, 542/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 624 constraints, problems are : Problem set: 0 solved, 2 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/111 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/142 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/342 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:31:21] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:31:21] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/371 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 150/521 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/522 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 20/542 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/542 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1141/1683 variables, 542/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1683 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1683 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1683 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 628 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2426ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1032 ms.
Support contains 4 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1141/1141 transitions.
Applied a total of 0 rules in 36 ms. Remains 542 /542 variables (removed 0) and now considering 1141/1141 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 542/542 places, 1141/1141 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1141/1141 transitions.
Applied a total of 0 rules in 35 ms. Remains 542 /542 variables (removed 0) and now considering 1141/1141 (removed 0) transitions.
[2024-05-31 23:31:24] [INFO ] Invariant cache hit.
[2024-05-31 23:31:24] [INFO ] Implicit Places using invariants in 809 ms returned [76, 97, 103, 106, 108, 109, 119, 120, 172, 189, 195, 198, 200, 201, 206, 207, 259, 276, 282, 285, 287, 288, 293, 294, 295, 348, 369, 375, 378, 380, 381, 386, 387, 442, 463, 469, 472, 474, 475, 479]
[2024-05-31 23:31:24] [INFO ] Actually due to overlaps returned [201, 288, 381, 479, 295, 97, 103, 108, 189, 195, 200, 276, 282, 287, 369, 375, 380, 463, 469, 474, 76, 109, 172, 259, 442, 475]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 812 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/542 places, 1141/1141 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 516 transition count 1136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 511 transition count 1136
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 32 place count 489 transition count 1114
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 489 transition count 1114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 484 transition count 1109
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 484 transition count 1109
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 475 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 473 transition count 1096
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 473 transition count 1096
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 103 place count 473 transition count 1079
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 120 place count 456 transition count 1079
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 456 transition count 1077
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 454 transition count 1077
Applied a total of 124 rules in 127 ms. Remains 454 /516 variables (removed 62) and now considering 1077/1141 (removed 64) transitions.
// Phase 1: matrix 1077 rows 454 cols
[2024-05-31 23:31:25] [INFO ] Computed 56 invariants in 11 ms
[2024-05-31 23:31:25] [INFO ] Implicit Places using invariants in 522 ms returned [101, 102, 172, 173, 243, 244, 296, 317, 318]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 526 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 445/542 places, 1077/1141 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 1076
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 444 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 443 transition count 1075
Applied a total of 4 rules in 52 ms. Remains 443 /445 variables (removed 2) and now considering 1075/1077 (removed 2) transitions.
// Phase 1: matrix 1075 rows 443 cols
[2024-05-31 23:31:25] [INFO ] Computed 47 invariants in 11 ms
[2024-05-31 23:31:26] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-31 23:31:26] [INFO ] Invariant cache hit.
[2024-05-31 23:31:27] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 443/542 places, 1075/1141 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3217 ms. Remains : 443/542 places, 1075/1141 transitions.
RANDOM walk for 40000 steps (706 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (187 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (193 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 246720 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 246720 steps, saw 105601 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-31 23:31:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/130 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/167 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/170 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/183 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 213/399 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/421 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/443 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/443 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1075/1518 variables, 443/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1518 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1518 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1518/1518 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/130 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:31:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/167 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/170 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/183 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/186 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 213/399 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 22/421 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 22/443 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1075/1518 variables, 443/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1518 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1518 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1518 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1518/1518 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1847ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1415 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1075/1075 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 441 transition count 1065
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 441 transition count 1065
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 441 transition count 1063
Applied a total of 6 rules in 30 ms. Remains 441 /443 variables (removed 2) and now considering 1063/1075 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 441/443 places, 1063/1075 transitions.
RANDOM walk for 40000 steps (713 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 389316 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389316 steps, saw 154341 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 1063 rows 441 cols
[2024-05-31 23:31:36] [INFO ] Computed 47 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/42 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/181 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/196 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/357 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 49/406 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 35/441 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1063/1504 variables, 441/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1504 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1504/1504 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 441/441 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) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/42 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/181 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/196 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/357 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 49/406 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 35/441 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1063/1504 variables, 441/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1504 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1504 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1504/1504 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 441/441 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2024-05-31 23:31:38] [INFO ] Invariant cache hit.
[2024-05-31 23:31:39] [INFO ] Implicit Places using invariants in 611 ms returned [22, 307]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/441 places, 1063/1063 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 439 transition count 1055
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 431 transition count 1055
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 429 transition count 1053
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 429 transition count 1051
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 427 transition count 1051
Applied a total of 24 rules in 48 ms. Remains 427 /439 variables (removed 12) and now considering 1051/1063 (removed 12) transitions.
// Phase 1: matrix 1051 rows 427 cols
[2024-05-31 23:31:39] [INFO ] Computed 45 invariants in 11 ms
[2024-05-31 23:31:39] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-31 23:31:39] [INFO ] Invariant cache hit.
[2024-05-31 23:31:40] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/441 places, 1051/1063 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2601 ms. Remains : 427/441 places, 1051/1063 transitions.
RANDOM walk for 40000 steps (735 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406579 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406579 steps, saw 227428 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
[2024-05-31 23:31:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/105 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/241 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/245 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 99/344 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/378 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/427 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1051/1478 variables, 427/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1478 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1478 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1478/1478 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 427/427 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) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/105 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/241 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/245 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 99/344 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/378 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:31:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 49/427 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1051/1478 variables, 427/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1478 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1478 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1478 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1478/1478 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 427/427 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 230 ms.
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1051/1051 transitions.
Applied a total of 0 rules in 16 ms. Remains 427 /427 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 427/427 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1051/1051 transitions.
Applied a total of 0 rules in 16 ms. Remains 427 /427 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2024-05-31 23:31:46] [INFO ] Invariant cache hit.
[2024-05-31 23:31:46] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-31 23:31:46] [INFO ] Invariant cache hit.
[2024-05-31 23:31:47] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2024-05-31 23:31:47] [INFO ] Redundant transitions in 99 ms returned []
Running 1025 sub problems to find dead transitions.
[2024-05-31 23:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 1025 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1025 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/427 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1025 unsolved
SMT process timed out in 31041ms, After SMT, problems are : Problem set: 0 solved, 1025 unsolved
Search for dead transitions found 0 dead transitions in 31061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33084 ms. Remains : 427/427 places, 1051/1051 transitions.
FORMULA ASLink-PT-05a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 1080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1077 transition count 1694
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1077 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1076 transition count 1686
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1076 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1075 transition count 1678
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1075 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1074 transition count 1670
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1074 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1073 transition count 1662
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1073 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1072 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1072 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1071 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1071 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1070 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1070 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1069 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1069 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1068 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1068 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1067 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1067 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1066 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1066 transition count 1606
Applied a total of 28 rules in 612 ms. Remains 1066 /1080 variables (removed 14) and now considering 1606/1714 (removed 108) transitions.
// Phase 1: matrix 1606 rows 1066 cols
[2024-05-31 23:32:20] [INFO ] Computed 147 invariants in 29 ms
[2024-05-31 23:32:21] [INFO ] Implicit Places using invariants in 1480 ms returned [29, 752, 757, 957]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1483 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1080 places, 1606/1714 transitions.
Applied a total of 0 rules in 47 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2144 ms. Remains : 1062/1080 places, 1606/1714 transitions.
Stuttering acceptance computed with spot in 605 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-00
Product exploration explored 100000 steps with 630 reset in 749 ms.
Product exploration explored 100000 steps with 612 reset in 417 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 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 245 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (244 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (34 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264074 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 264074 steps, saw 99559 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 1606 rows 1062 cols
[2024-05-31 23:32:26] [INFO ] Computed 143 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/455 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 583/1038 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1038 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1062 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1062 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1606/2668 variables, 1062/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2668 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2668 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2668/2668 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 112/112 constraints, State Equation: 1062/1062 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) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/455 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 583/1038 variables, 102/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1038 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1062 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1062 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1606/2668 variables, 1062/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2668 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2668 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2668 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2668/2668 variables, and 1206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 112/112 constraints, State Equation: 1062/1062 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3670ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1062 transition count 1405
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 861 transition count 1405
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 402 place count 861 transition count 1264
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 327 rules applied. Total rules applied 729 place count 675 transition count 1264
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 17 rules applied. Total rules applied 746 place count 667 transition count 1255
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 755 place count 658 transition count 1255
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 755 place count 658 transition count 1235
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 795 place count 638 transition count 1235
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 800 place count 633 transition count 1230
Iterating global reduction 4 with 5 rules applied. Total rules applied 805 place count 633 transition count 1230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 809 place count 633 transition count 1226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 810 place count 632 transition count 1226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 810 place count 632 transition count 1225
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 812 place count 631 transition count 1225
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 928 place count 573 transition count 1167
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 932 place count 573 transition count 1163
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 936 place count 569 transition count 1163
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 955 place count 569 transition count 1144
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 975 place count 549 transition count 1144
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 979 place count 549 transition count 1140
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 995 place count 549 transition count 1140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 996 place count 548 transition count 1139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1001 place count 543 transition count 1139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 1001 place count 543 transition count 1129
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1026 place count 528 transition count 1129
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1031 place count 523 transition count 1124
Iterating global reduction 9 with 5 rules applied. Total rules applied 1036 place count 523 transition count 1124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1041 place count 523 transition count 1119
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 10 with 2 rules applied. Total rules applied 1043 place count 522 transition count 1118
Applied a total of 1043 rules in 375 ms. Remains 522 /1062 variables (removed 540) and now considering 1118/1606 (removed 488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 522/1062 places, 1118/1606 transitions.
RANDOM walk for 40000 steps (700 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (153 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 798 steps, run visited all 1 properties in 8 ms. (steps per millisecond=99 )
Probabilistic random walk after 798 steps, saw 763 distinct states, run finished after 14 ms. (steps per millisecond=57 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 13 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLCardinality-00 finished in 11926 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 1080 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1079 transition count 1526
Reduce places removed 193 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 195 rules applied. Total rules applied 382 place count 886 transition count 1524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 884 transition count 1524
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 384 place count 884 transition count 1368
Deduced a syphon composed of 156 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 357 rules applied. Total rules applied 741 place count 683 transition count 1368
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 31 rules applied. Total rules applied 772 place count 671 transition count 1349
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 791 place count 652 transition count 1349
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 791 place count 652 transition count 1328
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 833 place count 631 transition count 1328
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 846 place count 618 transition count 1293
Iterating global reduction 5 with 13 rules applied. Total rules applied 859 place count 618 transition count 1293
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 12 rules applied. Total rules applied 871 place count 615 transition count 1284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 872 place count 614 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 873 place count 613 transition count 1276
Iterating global reduction 7 with 1 rules applied. Total rules applied 874 place count 613 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 875 place count 612 transition count 1268
Iterating global reduction 7 with 1 rules applied. Total rules applied 876 place count 612 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 877 place count 611 transition count 1260
Iterating global reduction 7 with 1 rules applied. Total rules applied 878 place count 611 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 879 place count 610 transition count 1252
Iterating global reduction 7 with 1 rules applied. Total rules applied 880 place count 610 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 881 place count 609 transition count 1244
Iterating global reduction 7 with 1 rules applied. Total rules applied 882 place count 609 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 883 place count 608 transition count 1236
Iterating global reduction 7 with 1 rules applied. Total rules applied 884 place count 608 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 885 place count 607 transition count 1228
Iterating global reduction 7 with 1 rules applied. Total rules applied 886 place count 607 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 887 place count 606 transition count 1220
Iterating global reduction 7 with 1 rules applied. Total rules applied 888 place count 606 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 889 place count 605 transition count 1212
Iterating global reduction 7 with 1 rules applied. Total rules applied 890 place count 605 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 891 place count 604 transition count 1204
Iterating global reduction 7 with 1 rules applied. Total rules applied 892 place count 604 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 893 place count 603 transition count 1196
Iterating global reduction 7 with 1 rules applied. Total rules applied 894 place count 603 transition count 1196
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 107 rules applied. Total rules applied 1001 place count 549 transition count 1143
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1005 place count 545 transition count 1139
Iterating global reduction 7 with 4 rules applied. Total rules applied 1009 place count 545 transition count 1139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1009 place count 545 transition count 1138
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 1011 place count 544 transition count 1138
Applied a total of 1011 rules in 465 ms. Remains 544 /1080 variables (removed 536) and now considering 1138/1714 (removed 576) transitions.
// Phase 1: matrix 1138 rows 544 cols
[2024-05-31 23:32:31] [INFO ] Computed 80 invariants in 18 ms
[2024-05-31 23:32:32] [INFO ] Implicit Places using invariants in 943 ms returned [21, 74, 95, 101, 106, 165, 182, 188, 193, 195, 255, 272, 278, 284, 286, 295, 348, 369, 375, 380, 382, 391, 444, 465, 471, 476, 478, 541]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 953 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 516/1080 places, 1138/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 516 transition count 1125
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 503 transition count 1125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 36 place count 493 transition count 1115
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 493 transition count 1115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 484 transition count 1106
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 484 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 479 transition count 1101
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 479 transition count 1101
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 100 place count 466 transition count 1088
Applied a total of 100 rules in 72 ms. Remains 466 /516 variables (removed 50) and now considering 1088/1138 (removed 50) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2024-05-31 23:32:32] [INFO ] Computed 52 invariants in 10 ms
[2024-05-31 23:32:33] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-05-31 23:32:33] [INFO ] Invariant cache hit.
[2024-05-31 23:32:35] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 466/1080 places, 1088/1714 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4244 ms. Remains : 466/1080 places, 1088/1714 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-01
Product exploration explored 100000 steps with 1441 reset in 335 ms.
Product exploration explored 100000 steps with 1426 reset in 347 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 107 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 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (603 resets) in 393 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (148 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225379 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225379 steps, saw 112489 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-31 23:32:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/159 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/383 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/417 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/466 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1088/1554 variables, 466/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1554 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1554 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 466/466 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) 144/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/159 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/383 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/417 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/466 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:32:40] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1088/1554 variables, 466/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1554/1554 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2847ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 466 transition count 1068
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 45 place count 446 transition count 1063
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 446 transition count 1049
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 73 place count 432 transition count 1049
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 74 place count 432 transition count 1049
Applied a total of 74 rules in 88 ms. Remains 432 /466 variables (removed 34) and now considering 1049/1088 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 432/466 places, 1049/1088 transitions.
RANDOM walk for 40000 steps (718 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 288254 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 288254 steps, saw 180528 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
// Phase 1: matrix 1049 rows 432 cols
[2024-05-31 23:32:45] [INFO ] Computed 52 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/320 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/346 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/398 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/416 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1049/1481 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1481 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1481/1481 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 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) 121/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/320 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/346 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/398 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/416 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1049/1481 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1481 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1481 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1481/1481 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4405 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5013ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 306 ms.
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 25 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 432/432 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 24 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-05-31 23:32:51] [INFO ] Invariant cache hit.
[2024-05-31 23:32:51] [INFO ] Implicit Places using invariants in 816 ms returned [88, 89, 159, 160, 232, 233, 303, 304]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 821 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 424/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 863 ms. Remains : 424/432 places, 1049/1049 transitions.
RANDOM walk for 40000 steps (711 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (184 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298491 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298491 steps, saw 187690 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 1049 rows 424 cols
[2024-05-31 23:32:55] [INFO ] Computed 44 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 150/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/162 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/341 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/375 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/424 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1049/1473 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1473 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1473 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1473/1473 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 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) 150/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/162 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/341 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/375 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:32:55] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/424 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1049/1473 variables, 424/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1473 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1473 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1473 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1473/1473 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3982ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 23 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 424/424 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 22 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-05-31 23:32:59] [INFO ] Invariant cache hit.
[2024-05-31 23:32:59] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-31 23:32:59] [INFO ] Invariant cache hit.
[2024-05-31 23:33:01] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
[2024-05-31 23:33:01] [INFO ] Redundant transitions in 28 ms returned []
Running 1023 sub problems to find dead transitions.
[2024-05-31 23:33:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1473 variables, and 38 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/424 constraints, PredecessorRefiner: 1023/1023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1473 variables, and 44 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/424 constraints, PredecessorRefiner: 0/1023 constraints, Known Traps: 0/0 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 61111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63290 ms. Remains : 424/424 places, 1049/1049 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 23:34:02] [INFO ] Invariant cache hit.
[2024-05-31 23:34:02] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:34:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-31 23:34:02] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 34 ms returned sat
[2024-05-31 23:34:04] [INFO ] After 1864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:34:05] [INFO ] After 2963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:34:08] [INFO ] After 5960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6226 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 38 ms :[(NOT p0)]
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Applied a total of 0 rules in 15 ms. Remains 466 /466 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2024-05-31 23:34:08] [INFO ] Computed 52 invariants in 10 ms
[2024-05-31 23:34:09] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-31 23:34:09] [INFO ] Invariant cache hit.
[2024-05-31 23:34:11] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
[2024-05-31 23:34:12] [INFO ] Redundant transitions in 54 ms returned []
Running 1057 sub problems to find dead transitions.
[2024-05-31 23:34:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1554 variables, and 46 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 1057/1057 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1057 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 3 (OVERLAPS) 1/466 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1554 variables, and 52 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 0/1057 constraints, Known Traps: 0/0 constraints]
After SMT, in 60975ms problems are : Problem set: 0 solved, 1057 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64153 ms. Remains : 466/466 places, 1088/1088 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 120 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 66 ms :[(NOT p0)]
RANDOM walk for 40000 steps (619 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (135 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250608 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250608 steps, saw 126750 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-31 23:35:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/159 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/383 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/417 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/466 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1088/1554 variables, 466/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1554 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1554 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 466/466 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) 144/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/159 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/383 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/417 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/466 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:35:17] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1554/1554 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1333 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 466 transition count 1068
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 45 place count 446 transition count 1063
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 446 transition count 1049
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 73 place count 432 transition count 1049
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 74 place count 432 transition count 1049
Applied a total of 74 rules in 116 ms. Remains 432 /466 variables (removed 34) and now considering 1049/1088 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 432/466 places, 1049/1088 transitions.
RANDOM walk for 40000 steps (745 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274053 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274053 steps, saw 170859 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1049 rows 432 cols
[2024-05-31 23:35:21] [INFO ] Computed 52 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/320 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/346 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/398 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/416 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1049/1481 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1481 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1481/1481 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 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) 121/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/320 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/346 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/398 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/416 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1049/1481 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1481 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1481 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1481/1481 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4328 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 393 ms.
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 24 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 432/432 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 23 ms. Remains 432 /432 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-05-31 23:35:27] [INFO ] Invariant cache hit.
[2024-05-31 23:35:28] [INFO ] Implicit Places using invariants in 868 ms returned [88, 89, 159, 160, 232, 233, 303, 304]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 870 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 424/432 places, 1049/1049 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 908 ms. Remains : 424/432 places, 1049/1049 transitions.
RANDOM walk for 40000 steps (777 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (196 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 316860 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 316860 steps, saw 200211 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
// Phase 1: matrix 1049 rows 424 cols
[2024-05-31 23:35:31] [INFO ] Computed 44 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 150/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/162 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/341 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/375 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/424 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1049/1473 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1473 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1473 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1473/1473 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 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) 150/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/162 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/341 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/375 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:35:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/424 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1049/1473 variables, 424/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1473 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1473 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1473 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1473/1473 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 132 ms.
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 31 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 424/424 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 23 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-05-31 23:35:35] [INFO ] Invariant cache hit.
[2024-05-31 23:35:36] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-31 23:35:36] [INFO ] Invariant cache hit.
[2024-05-31 23:35:37] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2024-05-31 23:35:37] [INFO ] Redundant transitions in 46 ms returned []
Running 1023 sub problems to find dead transitions.
[2024-05-31 23:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1473 variables, and 38 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/424 constraints, PredecessorRefiner: 1023/1023 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1473 variables, and 44 constraints, problems are : Problem set: 0 solved, 1023 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/424 constraints, PredecessorRefiner: 0/1023 constraints, Known Traps: 0/0 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 60756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62974 ms. Remains : 424/424 places, 1049/1049 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 23:36:38] [INFO ] Invariant cache hit.
[2024-05-31 23:36:38] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:36:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-31 23:36:38] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 34 ms returned sat
[2024-05-31 23:36:40] [INFO ] After 1938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:36:41] [INFO ] After 2849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:36:43] [INFO ] After 5399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5575 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1465 reset in 354 ms.
Product exploration explored 100000 steps with 1488 reset in 395 ms.
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 1088/1088 transitions.
Applied a total of 0 rules in 24 ms. Remains 466 /466 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
// Phase 1: matrix 1088 rows 466 cols
[2024-05-31 23:36:44] [INFO ] Computed 52 invariants in 16 ms
[2024-05-31 23:36:45] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-31 23:36:45] [INFO ] Invariant cache hit.
[2024-05-31 23:36:47] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 2992 ms to find 0 implicit places.
[2024-05-31 23:36:47] [INFO ] Redundant transitions in 38 ms returned []
Running 1057 sub problems to find dead transitions.
[2024-05-31 23:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 4.0)
(s452 1.0)
(s453 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1554 variables, and 46 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/10 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 1057/1057 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1057 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 3 (OVERLAPS) 1/466 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1554 variables, and 52 constraints, problems are : Problem set: 0 solved, 1057 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 0/1057 constraints, Known Traps: 0/0 constraints]
After SMT, in 60910ms problems are : Problem set: 0 solved, 1057 unsolved
Search for dead transitions found 0 dead transitions in 60933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64023 ms. Remains : 466/466 places, 1088/1088 transitions.
Treatment of property ASLink-PT-05a-LTLCardinality-01 finished in 317966 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||(p1 U p2)))&&F(G(p3)))))'
Support contains 6 out of 1080 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 1080 transition count 1533
Reduce places removed 181 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 185 rules applied. Total rules applied 366 place count 899 transition count 1529
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 370 place count 895 transition count 1529
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 370 place count 895 transition count 1389
Deduced a syphon composed of 140 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 325 rules applied. Total rules applied 695 place count 710 transition count 1389
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 710 place count 704 transition count 1380
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 719 place count 695 transition count 1380
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 719 place count 695 transition count 1360
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 759 place count 675 transition count 1360
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 767 place count 667 transition count 1330
Iterating global reduction 5 with 8 rules applied. Total rules applied 775 place count 667 transition count 1330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 6 rules applied. Total rules applied 781 place count 665 transition count 1326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 782 place count 664 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 783 place count 663 transition count 1318
Iterating global reduction 7 with 1 rules applied. Total rules applied 784 place count 663 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 785 place count 662 transition count 1310
Iterating global reduction 7 with 1 rules applied. Total rules applied 786 place count 662 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 787 place count 661 transition count 1302
Iterating global reduction 7 with 1 rules applied. Total rules applied 788 place count 661 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 789 place count 660 transition count 1294
Iterating global reduction 7 with 1 rules applied. Total rules applied 790 place count 660 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 791 place count 659 transition count 1286
Iterating global reduction 7 with 1 rules applied. Total rules applied 792 place count 659 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 658 transition count 1278
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 658 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 657 transition count 1270
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 657 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 656 transition count 1262
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 656 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 655 transition count 1254
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 655 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 654 transition count 1246
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 654 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 653 transition count 1238
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 653 transition count 1238
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 107 rules applied. Total rules applied 911 place count 599 transition count 1185
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 914 place count 596 transition count 1182
Iterating global reduction 7 with 3 rules applied. Total rules applied 917 place count 596 transition count 1182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 917 place count 596 transition count 1181
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 919 place count 595 transition count 1181
Applied a total of 919 rules in 442 ms. Remains 595 /1080 variables (removed 485) and now considering 1181/1714 (removed 533) transitions.
// Phase 1: matrix 1181 rows 595 cols
[2024-05-31 23:37:49] [INFO ] Computed 93 invariants in 11 ms
[2024-05-31 23:37:50] [INFO ] Implicit Places using invariants in 823 ms returned [24, 99, 105, 110, 127, 197, 203, 208, 225, 296, 302, 307, 323, 324, 400, 406, 411, 434, 435, 510, 516, 521, 540, 592]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 826 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1080 places, 1181/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 571 transition count 1166
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 556 transition count 1166
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 556 transition count 1157
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 547 transition count 1157
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 546 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 545 transition count 1156
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 61 place count 535 transition count 1146
Iterating global reduction 4 with 10 rules applied. Total rules applied 71 place count 535 transition count 1146
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 81 place count 525 transition count 1136
Iterating global reduction 4 with 10 rules applied. Total rules applied 91 place count 525 transition count 1136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 96 place count 520 transition count 1131
Iterating global reduction 4 with 5 rules applied. Total rules applied 101 place count 520 transition count 1131
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 125 place count 508 transition count 1119
Applied a total of 125 rules in 118 ms. Remains 508 /571 variables (removed 63) and now considering 1119/1181 (removed 62) transitions.
// Phase 1: matrix 1119 rows 508 cols
[2024-05-31 23:37:50] [INFO ] Computed 68 invariants in 15 ms
[2024-05-31 23:37:51] [INFO ] Implicit Places using invariants in 851 ms returned [180, 183, 266, 269, 355, 358, 441, 444]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 854 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/1080 places, 1119/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 500 transition count 1115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 496 transition count 1115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 492 transition count 1111
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 492 transition count 1111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 492 transition count 1107
Applied a total of 20 rules in 63 ms. Remains 492 /500 variables (removed 8) and now considering 1107/1119 (removed 12) transitions.
// Phase 1: matrix 1107 rows 492 cols
[2024-05-31 23:37:51] [INFO ] Computed 60 invariants in 15 ms
[2024-05-31 23:37:52] [INFO ] Implicit Places using invariants in 919 ms returned [159, 240, 321, 408]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 924 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 488/1080 places, 1107/1714 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 484 transition count 1103
Applied a total of 8 rules in 45 ms. Remains 484 /488 variables (removed 4) and now considering 1103/1107 (removed 4) transitions.
// Phase 1: matrix 1103 rows 484 cols
[2024-05-31 23:37:52] [INFO ] Computed 56 invariants in 16 ms
[2024-05-31 23:37:53] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-31 23:37:53] [INFO ] Invariant cache hit.
[2024-05-31 23:37:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 23:37:55] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 484/1080 places, 1103/1714 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 6552 ms. Remains : 484/1080 places, 1103/1714 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-02
Stuttering criterion allowed to conclude after 583 steps with 9 reset in 5 ms.
FORMULA ASLink-PT-05a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-02 finished in 6810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(F((X((F(p1)||p0)) U p1)))))))'
Support contains 1 out of 1080 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1080 transition count 1531
Reduce places removed 183 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 184 rules applied. Total rules applied 367 place count 897 transition count 1530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 896 transition count 1530
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 142 Pre rules applied. Total rules applied 368 place count 896 transition count 1388
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 3 with 329 rules applied. Total rules applied 697 place count 709 transition count 1388
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 712 place count 703 transition count 1379
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 721 place count 694 transition count 1379
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 721 place count 694 transition count 1359
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 761 place count 674 transition count 1359
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 769 place count 666 transition count 1329
Iterating global reduction 5 with 8 rules applied. Total rules applied 777 place count 666 transition count 1329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 6 rules applied. Total rules applied 783 place count 664 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 784 place count 663 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 785 place count 662 transition count 1317
Iterating global reduction 7 with 1 rules applied. Total rules applied 786 place count 662 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 787 place count 661 transition count 1309
Iterating global reduction 7 with 1 rules applied. Total rules applied 788 place count 661 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 789 place count 660 transition count 1301
Iterating global reduction 7 with 1 rules applied. Total rules applied 790 place count 660 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 791 place count 659 transition count 1293
Iterating global reduction 7 with 1 rules applied. Total rules applied 792 place count 659 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 658 transition count 1285
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 658 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 657 transition count 1277
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 657 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 656 transition count 1269
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 656 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 655 transition count 1261
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 655 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 654 transition count 1253
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 654 transition count 1253
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 653 transition count 1245
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 653 transition count 1245
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 652 transition count 1237
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 652 transition count 1237
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 111 rules applied. Total rules applied 917 place count 596 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 920 place count 593 transition count 1179
Iterating global reduction 7 with 3 rules applied. Total rules applied 923 place count 593 transition count 1179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 923 place count 593 transition count 1178
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 925 place count 592 transition count 1178
Applied a total of 925 rules in 472 ms. Remains 592 /1080 variables (removed 488) and now considering 1178/1714 (removed 536) transitions.
// Phase 1: matrix 1178 rows 592 cols
[2024-05-31 23:37:56] [INFO ] Computed 93 invariants in 19 ms
[2024-05-31 23:37:57] [INFO ] Implicit Places using invariants in 1194 ms returned [21, 96, 102, 107, 123, 193, 199, 204, 220, 292, 298, 303, 323, 399, 405, 410, 430, 431, 432, 507, 513, 518, 537, 589]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1199 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1080 places, 1178/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 568 transition count 1163
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 553 transition count 1163
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 553 transition count 1154
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 544 transition count 1154
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 543 transition count 1154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 60 place count 532 transition count 1143
Iterating global reduction 3 with 11 rules applied. Total rules applied 71 place count 532 transition count 1143
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 81 place count 522 transition count 1133
Iterating global reduction 3 with 10 rules applied. Total rules applied 91 place count 522 transition count 1133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 517 transition count 1128
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 517 transition count 1128
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 125 place count 505 transition count 1116
Applied a total of 125 rules in 130 ms. Remains 505 /568 variables (removed 63) and now considering 1116/1178 (removed 62) transitions.
// Phase 1: matrix 1116 rows 505 cols
[2024-05-31 23:37:57] [INFO ] Computed 68 invariants in 16 ms
[2024-05-31 23:37:58] [INFO ] Implicit Places using invariants in 1045 ms returned [93, 96, 177, 180, 354, 357, 438, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1047 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1080 places, 1116/1714 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 1112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 493 transition count 1112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 489 transition count 1108
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 489 transition count 1108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 489 transition count 1104
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 3 with 2 rules applied. Total rules applied 22 place count 488 transition count 1103
Applied a total of 22 rules in 77 ms. Remains 488 /497 variables (removed 9) and now considering 1103/1116 (removed 13) transitions.
// Phase 1: matrix 1103 rows 488 cols
[2024-05-31 23:37:59] [INFO ] Computed 60 invariants in 15 ms
[2024-05-31 23:38:00] [INFO ] Implicit Places using invariants in 941 ms returned [72, 151, 324, 404]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 945 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 484/1080 places, 1103/1714 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 480 transition count 1099
Applied a total of 8 rules in 46 ms. Remains 480 /484 variables (removed 4) and now considering 1099/1103 (removed 4) transitions.
// Phase 1: matrix 1099 rows 480 cols
[2024-05-31 23:38:00] [INFO ] Computed 56 invariants in 17 ms
[2024-05-31 23:38:01] [INFO ] Implicit Places using invariants in 977 ms returned []
[2024-05-31 23:38:01] [INFO ] Invariant cache hit.
[2024-05-31 23:38:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 23:38:03] [INFO ] Implicit Places using invariants and state equation in 2500 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 480/1080 places, 1099/1714 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 7403 ms. Remains : 480/1080 places, 1099/1714 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-03
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-03 finished in 7534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(F(p2)||X(p3)))))'
Support contains 6 out of 1080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1078 transition count 1700
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1078 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1077 transition count 1692
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1077 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1076 transition count 1684
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1076 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1075 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1075 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1074 transition count 1668
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1074 transition count 1668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1073 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1073 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1072 transition count 1652
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1072 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1071 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1071 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1070 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1070 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1069 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1069 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1068 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1068 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1067 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1067 transition count 1612
Applied a total of 26 rules in 603 ms. Remains 1067 /1080 variables (removed 13) and now considering 1612/1714 (removed 102) transitions.
// Phase 1: matrix 1612 rows 1067 cols
[2024-05-31 23:38:04] [INFO ] Computed 147 invariants in 23 ms
[2024-05-31 23:38:05] [INFO ] Implicit Places using invariants in 1522 ms returned [574, 752]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1525 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1065/1080 places, 1612/1714 transitions.
Applied a total of 0 rules in 46 ms. Remains 1065 /1065 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2178 ms. Remains : 1065/1080 places, 1612/1714 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-08
Product exploration explored 100000 steps with 596 reset in 467 ms.
Product exploration explored 100000 steps with 631 reset in 468 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 p0) p1 p2 p3), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 105 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (240 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (39 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 208279 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 208279 steps, saw 79088 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1612 rows 1065 cols
[2024-05-31 23:38:10] [INFO ] Computed 145 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/138 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 350/488 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 547/1035 variables, 99/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1035 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1065 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1612/2677 variables, 1065/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2677/2677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 1065/1065 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) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/138 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:38:11] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 350/488 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 547/1035 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1035 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/1065 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1065 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1612/2677 variables, 1065/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2677 variables, 1/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2677 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2677 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2677/2677 variables, and 1212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 1065/1065 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 573 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1065 transition count 1418
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 388 place count 871 transition count 1418
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 142 Pre rules applied. Total rules applied 388 place count 871 transition count 1276
Deduced a syphon composed of 142 places in 3 ms
Ensure Unique test removed 45 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 329 rules applied. Total rules applied 717 place count 684 transition count 1276
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 733 place count 677 transition count 1267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 742 place count 668 transition count 1267
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 742 place count 668 transition count 1247
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 782 place count 648 transition count 1247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 786 place count 644 transition count 1243
Iterating global reduction 4 with 4 rules applied. Total rules applied 790 place count 644 transition count 1243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 794 place count 644 transition count 1239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 795 place count 643 transition count 1239
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 115 rules applied. Total rules applied 910 place count 585 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 584 transition count 1181
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 584 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 912 place count 584 transition count 1180
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 914 place count 583 transition count 1180
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 917 place count 583 transition count 1177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 920 place count 580 transition count 1177
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 938 place count 580 transition count 1159
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 957 place count 561 transition count 1159
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 960 place count 561 transition count 1156
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 976 place count 561 transition count 1156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 977 place count 560 transition count 1155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 982 place count 555 transition count 1155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 982 place count 555 transition count 1145
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1007 place count 540 transition count 1145
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1012 place count 535 transition count 1140
Iterating global reduction 9 with 5 rules applied. Total rules applied 1017 place count 535 transition count 1140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1022 place count 535 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1026 place count 533 transition count 1133
Applied a total of 1026 rules in 334 ms. Remains 533 /1065 variables (removed 532) and now considering 1133/1612 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 533/1065 places, 1133/1612 transitions.
RANDOM walk for 40000 steps (634 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (149 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 229523 steps, run visited all 1 properties in 1976 ms. (steps per millisecond=116 )
Probabilistic random walk after 229523 steps, saw 67446 distinct states, run finished after 1980 ms. (steps per millisecond=115 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 11 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLCardinality-08 finished in 13121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1076 transition count 1688
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1076 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1075 transition count 1680
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1075 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1074 transition count 1672
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1074 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1073 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1073 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1072 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1072 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1071 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1071 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1070 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1070 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1069 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1069 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1068 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1068 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1067 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1067 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1066 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1066 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1065 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1065 transition count 1600
Applied a total of 30 rules in 618 ms. Remains 1065 /1080 variables (removed 15) and now considering 1600/1714 (removed 114) transitions.
// Phase 1: matrix 1600 rows 1065 cols
[2024-05-31 23:38:17] [INFO ] Computed 147 invariants in 28 ms
[2024-05-31 23:38:18] [INFO ] Implicit Places using invariants in 1376 ms returned [29, 573, 751, 756, 956]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1380 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1080 places, 1600/1714 transitions.
Applied a total of 0 rules in 48 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2048 ms. Remains : 1060/1080 places, 1600/1714 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 991 ms.
Product exploration explored 100000 steps with 50000 reset in 925 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLCardinality-11 finished in 4125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p0)))))'
Support contains 2 out of 1080 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1080/1080 places, 1714/1714 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1076 transition count 1688
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1076 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1075 transition count 1680
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1075 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1074 transition count 1672
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1074 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1073 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1073 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1072 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1072 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1071 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1071 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1070 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1070 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1069 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1069 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1068 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1068 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1067 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1067 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1066 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1066 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1065 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1065 transition count 1600
Applied a total of 30 rules in 361 ms. Remains 1065 /1080 variables (removed 15) and now considering 1600/1714 (removed 114) transitions.
[2024-05-31 23:38:21] [INFO ] Invariant cache hit.
[2024-05-31 23:38:22] [INFO ] Implicit Places using invariants in 1499 ms returned [29, 573, 751, 756, 956]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1502 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1080 places, 1600/1714 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1911 ms. Remains : 1060/1080 places, 1600/1714 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-12
Product exploration explored 100000 steps with 760 reset in 451 ms.
Product exploration explored 100000 steps with 761 reset in 694 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2284 steps (12 resets) in 17 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 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)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1059 transition count 1394
Reduce places removed 209 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 213 rules applied. Total rules applied 418 place count 850 transition count 1390
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 424 place count 846 transition count 1388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 427 place count 843 transition count 1388
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 149 Pre rules applied. Total rules applied 427 place count 843 transition count 1239
Deduced a syphon composed of 149 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 769 place count 650 transition count 1239
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 34 rules applied. Total rules applied 803 place count 635 transition count 1220
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 822 place count 616 transition count 1220
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 822 place count 616 transition count 1200
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 862 place count 596 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 872 place count 586 transition count 1190
Iterating global reduction 6 with 10 rules applied. Total rules applied 882 place count 586 transition count 1190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 6 with 9 rules applied. Total rules applied 891 place count 586 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 892 place count 585 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 892 place count 585 transition count 1180
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 894 place count 584 transition count 1180
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 1004 place count 529 transition count 1125
Applied a total of 1004 rules in 155 ms. Remains 529 /1060 variables (removed 531) and now considering 1125/1600 (removed 475) transitions.
// Phase 1: matrix 1125 rows 529 cols
[2024-05-31 23:38:25] [INFO ] Computed 78 invariants in 16 ms
[2024-05-31 23:38:26] [INFO ] Implicit Places using invariants in 1114 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 371, 373, 433, 450, 456, 461, 463, 526]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1124 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1060 places, 1125/1600 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 504 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 503 transition count 1124
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 494 transition count 1115
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 494 transition count 1115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 485 transition count 1106
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 485 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 480 transition count 1101
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 480 transition count 1101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 470 transition count 1091
Applied a total of 68 rules in 105 ms. Remains 470 /504 variables (removed 34) and now considering 1091/1125 (removed 34) transitions.
// Phase 1: matrix 1091 rows 470 cols
[2024-05-31 23:38:26] [INFO ] Computed 53 invariants in 15 ms
[2024-05-31 23:38:27] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-05-31 23:38:27] [INFO ] Invariant cache hit.
[2024-05-31 23:38:29] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 3012 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 470/1060 places, 1091/1600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4397 ms. Remains : 470/1060 places, 1091/1600 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 261 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 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1313 steps (16 resets) in 12 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 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)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1685 reset in 365 ms.
Product exploration explored 100000 steps with 1652 reset in 391 ms.
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 1091/1091 transitions.
Applied a total of 0 rules in 15 ms. Remains 470 /470 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
[2024-05-31 23:38:31] [INFO ] Invariant cache hit.
[2024-05-31 23:38:31] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-31 23:38:31] [INFO ] Invariant cache hit.
[2024-05-31 23:38:33] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2024-05-31 23:38:33] [INFO ] Redundant transitions in 35 ms returned []
Running 1060 sub problems to find dead transitions.
[2024-05-31 23:38:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/1561 variables, and 48 constraints, problems are : Problem set: 0 solved, 1060 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 1060/1060 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1060 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 3 (OVERLAPS) 1/470 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
[2024-05-31 23:39:33] [INFO ] Deduced a trap composed of 94 places in 698 ms of which 8 ms to minimize.
[2024-05-31 23:39:34] [INFO ] Deduced a trap composed of 93 places in 625 ms of which 8 ms to minimize.
SMT process timed out in 61218ms, After SMT, problems are : Problem set: 0 solved, 1060 unsolved
Search for dead transitions found 0 dead transitions in 61243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63785 ms. Remains : 470/470 places, 1091/1091 transitions.
Treatment of property ASLink-PT-05a-LTLCardinality-12 finished in 74006 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' '!(X((p0&&G(F(p0)))))'
[2024-05-31 23:39:35] [INFO ] Flatten gal took : 161 ms
[2024-05-31 23:39:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 23:39:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1080 places, 1714 transitions and 6060 arcs took 67 ms.
Total runtime 557784 ms.
There are residual formulas that ITS could not solve within timeout

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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-05a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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