Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ASLink-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 677K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748594375978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 08:39:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 08:39:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 08:39:37] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-05-30 08:39:37] [INFO ] Transformed 1601 places.
[2025-05-30 08:39:37] [INFO ] Transformed 2373 transitions.
[2025-05-30 08:39:37] [INFO ] Found NUPN structural information;
[2025-05-30 08:39:37] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1559 transition count 2348
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 1548 transition count 2302
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 1547 transition count 2302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 1547 transition count 2300
Applied a total of 67 rules in 344 ms. Remains 1547 /1601 variables (removed 54) and now considering 2300/2348 (removed 48) transitions.
// Phase 1: matrix 2300 rows 1547 cols
[2025-05-30 08:39:38] [INFO ] Computed 265 invariants in 140 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:39:39] [INFO ] Implicit Places using invariants in 1560 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 966, 971, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1331, 1343, 1349, 1350, 1385, 1387, 1390, 1408, 1409, 1410, 1411, 1428, 1436, 1444, 1450, 1456, 1462, 1468, 1476, 1482, 1488, 1496]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1597 ms to find 70 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1477/1601 places, 2300/2348 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1464 transition count 2287
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1464 transition count 2287
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1454 transition count 2277
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1454 transition count 2277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1449 transition count 2272
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1449 transition count 2272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1447 transition count 2270
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1447 transition count 2270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1445 transition count 2268
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1445 transition count 2268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1444 transition count 2267
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1444 transition count 2267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1443 transition count 2266
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1443 transition count 2266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1442 transition count 2265
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1442 transition count 2265
Applied a total of 70 rules in 366 ms. Remains 1442 /1477 variables (removed 35) and now considering 2265/2300 (removed 35) transitions.
// Phase 1: matrix 2265 rows 1442 cols
[2025-05-30 08:39:40] [INFO ] Computed 195 invariants in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:39:41] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2025-05-30 08:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:39:44] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1442/1601 places, 2265/2348 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6879 ms. Remains : 1442/1601 places, 2265/2348 transitions.
Support contains 37 out of 1442 places after structural reductions.
[2025-05-30 08:39:44] [INFO ] Flatten gal took : 203 ms
[2025-05-30 08:39:45] [INFO ] Flatten gal took : 165 ms
[2025-05-30 08:39:45] [INFO ] Input system was already deterministic with 2265 transitions.
Support contains 32 out of 1442 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (218 resets) in 1343 ms. (29 steps per ms) remains 6/18 properties
BEST_FIRST walk for 40004 steps (23 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (22 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (23 resets) in 257 ms. (155 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (22 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (22 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
[2025-05-30 08:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 121/127 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 467/594 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 821/1415 variables, 144/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/1442 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2265/3707 variables, 1442/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3707 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3707 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3707/3707 variables, and 1637 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1442/1442 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 121/127 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 467/594 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 821/1415 variables, 144/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/1442 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2265/3707 variables, 1442/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3707 variables, 5/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3707 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3707 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3707/3707 variables, and 1642 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1442/1442 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7163ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8160 ms.
Support contains 6 out of 1442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 1442 transition count 1995
Reduce places removed 270 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 271 rules applied. Total rules applied 541 place count 1172 transition count 1994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 1171 transition count 1994
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 181 Pre rules applied. Total rules applied 542 place count 1171 transition count 1813
Deduced a syphon composed of 181 places in 1 ms
Ensure Unique test removed 61 places
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 423 rules applied. Total rules applied 965 place count 929 transition count 1813
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 977 place count 922 transition count 1808
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 982 place count 917 transition count 1808
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 982 place count 917 transition count 1788
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1022 place count 897 transition count 1788
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1025 place count 894 transition count 1777
Iterating global reduction 5 with 3 rules applied. Total rules applied 1028 place count 894 transition count 1777
Discarding 4 places :
Implicit places reduction removed 4 places
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 5 with 17 rules applied. Total rules applied 1045 place count 890 transition count 1764
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1058 place count 877 transition count 1764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1058 place count 877 transition count 1763
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1060 place count 876 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1064 place count 872 transition count 1752
Iterating global reduction 7 with 4 rules applied. Total rules applied 1068 place count 872 transition count 1752
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1071 place count 872 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1072 place count 871 transition count 1741
Iterating global reduction 8 with 1 rules applied. Total rules applied 1073 place count 871 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1074 place count 870 transition count 1733
Iterating global reduction 8 with 1 rules applied. Total rules applied 1075 place count 870 transition count 1733
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1076 place count 869 transition count 1725
Iterating global reduction 8 with 1 rules applied. Total rules applied 1077 place count 869 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1078 place count 868 transition count 1717
Iterating global reduction 8 with 1 rules applied. Total rules applied 1079 place count 868 transition count 1717
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1080 place count 867 transition count 1709
Iterating global reduction 8 with 1 rules applied. Total rules applied 1081 place count 867 transition count 1709
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1082 place count 866 transition count 1701
Iterating global reduction 8 with 1 rules applied. Total rules applied 1083 place count 866 transition count 1701
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1084 place count 865 transition count 1693
Iterating global reduction 8 with 1 rules applied. Total rules applied 1085 place count 865 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1086 place count 864 transition count 1685
Iterating global reduction 8 with 1 rules applied. Total rules applied 1087 place count 864 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1088 place count 863 transition count 1677
Iterating global reduction 8 with 1 rules applied. Total rules applied 1089 place count 863 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1090 place count 862 transition count 1669
Iterating global reduction 8 with 1 rules applied. Total rules applied 1091 place count 862 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1092 place count 861 transition count 1661
Iterating global reduction 8 with 1 rules applied. Total rules applied 1093 place count 861 transition count 1661
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1094 place count 860 transition count 1653
Iterating global reduction 8 with 1 rules applied. Total rules applied 1095 place count 860 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1096 place count 859 transition count 1645
Iterating global reduction 8 with 1 rules applied. Total rules applied 1097 place count 859 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1098 place count 858 transition count 1637
Iterating global reduction 8 with 1 rules applied. Total rules applied 1099 place count 858 transition count 1637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1100 place count 857 transition count 1629
Iterating global reduction 8 with 1 rules applied. Total rules applied 1101 place count 857 transition count 1629
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 8 with 162 rules applied. Total rules applied 1263 place count 776 transition count 1548
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 1270 place count 776 transition count 1541
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1277 place count 769 transition count 1541
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 9 with 33 rules applied. Total rules applied 1310 place count 769 transition count 1508
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 9 with 34 rules applied. Total rules applied 1344 place count 735 transition count 1508
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1350 place count 735 transition count 1502
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1372 place count 735 transition count 1502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1373 place count 734 transition count 1501
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1382 place count 726 transition count 1500
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 1382 place count 726 transition count 1482
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 42 rules applied. Total rules applied 1424 place count 702 transition count 1482
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1430 place count 696 transition count 1476
Iterating global reduction 11 with 6 rules applied. Total rules applied 1436 place count 696 transition count 1476
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1442 place count 696 transition count 1470
Applied a total of 1442 rules in 1263 ms. Remains 696 /1442 variables (removed 746) and now considering 1470/2265 (removed 795) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 696/1442 places, 1470/2265 transitions.
RANDOM walk for 40000 steps (606 resets) in 347 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (103 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (101 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (101 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (102 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 351605 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 5
Probabilistic random walk after 351605 steps, saw 70208 distinct states, run finished after 3006 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1470 rows 696 cols
[2025-05-30 08:40:06] [INFO ] Computed 108 invariants in 12 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 277/342 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 56/398 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 259/657 variables, 47/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/663 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/664 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 32/696 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/696 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1470/2166 variables, 696/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2166 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2166 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2166/2166 variables, and 804 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 696/696 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 277/342 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 56/398 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 259/657 variables, 47/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/663 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/664 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 32/696 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/696 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1470/2166 variables, 696/804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2166 variables, 5/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2166 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/2166 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2166/2166 variables, and 809 constraints, problems are : Problem set: 0 solved, 5 unsolved in 24966 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 696/696 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26087ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 4184 ms.
Support contains 3 out of 696 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 696/696 places, 1470/1470 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 696 transition count 1469
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 694 transition count 1469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 693 transition count 1468
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 693 transition count 1468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 693 transition count 1467
Applied a total of 6 rules in 72 ms. Remains 693 /696 variables (removed 3) and now considering 1467/1470 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 693/696 places, 1467/1470 transitions.
RANDOM walk for 40000 steps (612 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 389943 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 389943 steps, saw 77963 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 1467 rows 693 cols
[2025-05-30 08:40:39] [INFO ] Computed 107 invariants in 15 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 157/170 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/214 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 334/548 variables, 50/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/585 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/586 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 107/693 variables, 22/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/693 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1467/2160 variables, 693/800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2160 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2160 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 800 constraints, problems are : Problem set: 0 solved, 2 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 157/170 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/214 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:40:40] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 334/548 variables, 50/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/585 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/586 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 107/693 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/693 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1467/2160 variables, 693/801 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2160 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2160 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2160 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 803 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3347ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 355 ms.
Support contains 3 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 1467/1467 transitions.
Applied a total of 0 rules in 25 ms. Remains 693 /693 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 693/693 places, 1467/1467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 1467/1467 transitions.
Applied a total of 0 rules in 32 ms. Remains 693 /693 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
[2025-05-30 08:40:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:44] [INFO ] Implicit Places using invariants in 713 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 275, 280, 281, 333, 350, 356, 359, 361, 362, 367, 368, 420, 437, 443, 446, 448, 449, 454, 455, 507, 524, 530, 533, 535, 536, 598, 607, 615, 621, 624, 627, 628, 629, 640]
[2025-05-30 08:40:44] [INFO ] Actually due to overlaps returned [187, 275, 362, 449, 536, 640, 628, 629, 88, 94, 99, 175, 181, 186, 262, 268, 273, 350, 356, 361, 437, 443, 448, 524, 530, 535, 71, 100, 158, 245, 333, 420, 507, 598]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 716 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 659/693 places, 1467/1467 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 634 transition count 1442
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 634 transition count 1442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 628 transition count 1436
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 628 transition count 1436
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 92 place count 613 transition count 1421
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 613 transition count 1403
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 128 place count 595 transition count 1403
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 137 place count 595 transition count 1394
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 146 place count 586 transition count 1394
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 147 place count 586 transition count 1394
Applied a total of 147 rules in 135 ms. Remains 586 /659 variables (removed 73) and now considering 1394/1467 (removed 73) transitions.
// Phase 1: matrix 1394 rows 586 cols
[2025-05-30 08:40:44] [INFO ] Computed 73 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:44] [INFO ] Implicit Places using invariants in 483 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 373, 374, 444, 445, 511, 517, 520, 523]
[2025-05-30 08:40:44] [INFO ] Actually due to overlaps returned [88, 159, 231, 302, 373, 444, 89, 160, 232, 303, 374, 445, 511, 517, 523]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 486 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 571/693 places, 1394/1467 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 567 transition count 1390
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 567 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 566 transition count 1389
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 566 transition count 1389
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 12 place count 565 transition count 1388
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 565 transition count 1385
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 562 transition count 1385
Applied a total of 18 rules in 82 ms. Remains 562 /571 variables (removed 9) and now considering 1385/1394 (removed 9) transitions.
// Phase 1: matrix 1385 rows 562 cols
[2025-05-30 08:40:44] [INFO ] Computed 58 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:45] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-05-30 08:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:46] [INFO ] Implicit Places using invariants and state equation in 1197 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 : 562/693 places, 1385/1467 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3117 ms. Remains : 562/693 places, 1385/1467 transitions.
RANDOM walk for 40000 steps (709 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (129 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 360682 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :1 out of 2
Probabilistic random walk after 360682 steps, saw 239549 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :1
[2025-05-30 08:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 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) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/198 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/461 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/464 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 98/562 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/198 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:40:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 263/461 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/464 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 98/562 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1385/1947 variables, 562/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1947 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1947 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1947 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3960 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 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 561 transition count 1384
Applied a total of 2 rules in 31 ms. Remains 561 /562 variables (removed 1) and now considering 1384/1385 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 561/562 places, 1384/1385 transitions.
RANDOM walk for 40000 steps (743 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393044 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 393044 steps, saw 263075 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 1384 rows 561 cols
[2025-05-30 08:40:57] [INFO ] Computed 58 invariants in 17 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 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) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/203 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 257/460 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/463 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 98/561 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 619 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/203 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 257/460 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/463 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 98/561 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1945 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8634 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 227 ms.
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 19 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 561/561 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2025-05-30 08:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:41:07] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 08:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:41:08] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:41:08] [INFO ] Redundant transitions in 101 ms returned []
Running 1350 sub problems to find dead transitions.
[2025-05-30 08:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1945 variables, and 54 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 45/46 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1945 variables, and 54 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 45/46 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60592ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 60601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62203 ms. Remains : 561/561 places, 1384/1384 transitions.
FORMULA ASLink-PT-07a-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1426 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1426 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1425 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1425 transition count 2128
Applied a total of 34 rules in 731 ms. Remains 1425 /1442 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1425 cols
[2025-05-30 08:42:10] [INFO ] Computed 195 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:11] [INFO ] Implicit Places using invariants in 861 ms returned [934, 1278]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 863 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1423/1442 places, 2128/2265 transitions.
Applied a total of 0 rules in 44 ms. Remains 1423 /1423 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1639 ms. Remains : 1423/1442 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 732 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-07a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07a-LTLCardinality-00 finished in 3495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1426 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1426 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1425 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1425 transition count 2128
Applied a total of 34 rules in 700 ms. Remains 1425 /1442 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
[2025-05-30 08:42:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:14] [INFO ] Implicit Places using invariants in 864 ms returned [934, 1278, 1298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 868 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1442 places, 2128/2265 transitions.
Applied a total of 0 rules in 39 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1608 ms. Remains : 1422/1442 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-02
Product exploration explored 100000 steps with 517 reset in 305 ms.
Product exploration explored 100000 steps with 499 reset in 308 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (24 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258678 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258678 steps, saw 88251 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 2128 rows 1422 cols
[2025-05-30 08:42:18] [INFO ] Computed 192 invariants in 20 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/592 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/592 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3550 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3550 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3550/3550 variables, and 1615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1422 transition count 1849
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1143 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1142 transition count 1848
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 560 place count 1142 transition count 1658
Deduced a syphon composed of 190 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 441 rules applied. Total rules applied 1001 place count 891 transition count 1658
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1021 place count 880 transition count 1649
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1030 place count 871 transition count 1649
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1030 place count 871 transition count 1621
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1086 place count 843 transition count 1621
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1091 place count 838 transition count 1616
Iterating global reduction 5 with 5 rules applied. Total rules applied 1096 place count 838 transition count 1616
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 1100 place count 838 transition count 1612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1101 place count 837 transition count 1612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1101 place count 837 transition count 1611
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 1103 place count 836 transition count 1611
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 1259 place count 758 transition count 1533
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1266 place count 758 transition count 1526
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1273 place count 751 transition count 1526
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 1302 place count 751 transition count 1497
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1332 place count 721 transition count 1497
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1339 place count 721 transition count 1490
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1361 place count 721 transition count 1490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1362 place count 720 transition count 1489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1369 place count 713 transition count 1489
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 14 Pre rules applied. Total rules applied 1369 place count 713 transition count 1475
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 35 rules applied. Total rules applied 1404 place count 692 transition count 1475
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1411 place count 685 transition count 1468
Iterating global reduction 10 with 7 rules applied. Total rules applied 1418 place count 685 transition count 1468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1425 place count 685 transition count 1461
Applied a total of 1425 rules in 273 ms. Remains 685 /1422 variables (removed 737) and now considering 1461/2128 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 685/1422 places, 1461/2128 transitions.
RANDOM walk for 40000 steps (657 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122359 steps, run visited all 1 properties in 834 ms. (steps per millisecond=146 )
Probabilistic random walk after 122359 steps, saw 40647 distinct states, run finished after 837 ms. (steps per millisecond=146 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 57 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
[2025-05-30 08:42:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:23] [INFO ] Implicit Places using invariants in 807 ms returned []
[2025-05-30 08:42:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:42:27] [INFO ] Implicit Places using invariants and state equation in 3658 ms returned []
Implicit Place search using SMT with State Equation took 4469 ms to find 0 implicit places.
Running 2127 sub problems to find dead transitions.
[2025-05-30 08:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 2127/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 0/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60680ms problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 60685ms
Finished structural reductions in LTL mode , in 1 iterations and 65221 ms. Remains : 1422/1422 places, 2128/2128 transitions.
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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (201 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (23 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 259041 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259041 steps, saw 88473 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-05-30 08:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/592 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3550 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/592 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2128/3550 variables, 1422/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3550 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3550 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3550 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3550/3550 variables, and 1615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1422 transition count 1849
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1143 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1142 transition count 1848
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 560 place count 1142 transition count 1658
Deduced a syphon composed of 190 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 441 rules applied. Total rules applied 1001 place count 891 transition count 1658
Discarding 11 places :
Implicit places reduction removed 11 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 20 rules applied. Total rules applied 1021 place count 880 transition count 1649
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1030 place count 871 transition count 1649
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1030 place count 871 transition count 1621
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1086 place count 843 transition count 1621
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1091 place count 838 transition count 1616
Iterating global reduction 5 with 5 rules applied. Total rules applied 1096 place count 838 transition count 1616
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 1100 place count 838 transition count 1612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1101 place count 837 transition count 1612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1101 place count 837 transition count 1611
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 1103 place count 836 transition count 1611
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 1259 place count 758 transition count 1533
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1266 place count 758 transition count 1526
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1273 place count 751 transition count 1526
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 1302 place count 751 transition count 1497
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1332 place count 721 transition count 1497
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1339 place count 721 transition count 1490
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1361 place count 721 transition count 1490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1362 place count 720 transition count 1489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1369 place count 713 transition count 1489
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 14 Pre rules applied. Total rules applied 1369 place count 713 transition count 1475
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 35 rules applied. Total rules applied 1404 place count 692 transition count 1475
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1411 place count 685 transition count 1468
Iterating global reduction 10 with 7 rules applied. Total rules applied 1418 place count 685 transition count 1468
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1425 place count 685 transition count 1461
Applied a total of 1425 rules in 257 ms. Remains 685 /1422 variables (removed 737) and now considering 1461/2128 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 685/1422 places, 1461/2128 transitions.
RANDOM walk for 40000 steps (619 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (110 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122359 steps, run visited all 1 properties in 829 ms. (steps per millisecond=147 )
Probabilistic random walk after 122359 steps, saw 40647 distinct states, run finished after 829 ms. (steps per millisecond=147 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 505 reset in 268 ms.
Product exploration explored 100000 steps with 512 reset in 292 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1422 transition count 2128
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 279 place count 1422 transition count 2161
Deduced a syphon composed of 381 places in 2 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 381 place count 1422 transition count 2161
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 387 place count 1419 transition count 2161
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 426 place count 1380 transition count 2122
Deduced a syphon composed of 347 places in 2 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 465 place count 1380 transition count 2122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 465 place count 1380 transition count 2122
Deduced a syphon composed of 348 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 466 place count 1380 transition count 2122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 467 place count 1379 transition count 2121
Deduced a syphon composed of 347 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 468 place count 1379 transition count 2121
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 527 places in 3 ms
Iterating global reduction 2 with 180 rules applied. Total rules applied 648 place count 1379 transition count 2145
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 742 place count 1285 transition count 2051
Deduced a syphon composed of 433 places in 2 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 836 place count 1285 transition count 2051
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 441 places in 2 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 844 place count 1285 transition count 2095
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 442 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 1285 transition count 2099
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 847 place count 1283 transition count 2093
Deduced a syphon composed of 440 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 849 place count 1283 transition count 2093
Deduced a syphon composed of 440 places in 2 ms
Applied a total of 849 rules in 684 ms. Remains 1283 /1422 variables (removed 139) and now considering 2093/2128 (removed 35) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:43:36] [INFO ] Redundant transitions in 63 ms returned []
Running 2092 sub problems to find dead transitions.
// Phase 1: matrix 2093 rows 1283 cols
[2025-05-30 08:43:36] [INFO ] Computed 189 invariants in 14 ms
[2025-05-30 08:43:36] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 16.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 8.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 6.0)
(s114 1.0)
(s115 1.0)
(s116 2.0)
(s117 1.0)
(s118 1.0)
(s119 18.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1282 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1282/3376 variables, and 135 constraints, problems are : Problem set: 0 solved, 2092 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/143 constraints, State Equation: 0/1283 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 2092/2092 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2092 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1282 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 2092 unsolved
(s426 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 16)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 8)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 6)
(s114 1)
(s115 1)
(s116 2)
(s117 1)
(s118 1)
(s119 18)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 8)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 6)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 3)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 16)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 8)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 12)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 8)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 2)
(s317 1)
(s318 1)
(s319 7)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 3)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 3)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 16)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 8)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1timeout
)
(s427 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1282/3376 variables, and 135 constraints, problems are : Problem set: 0 solved, 2092 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 135/143 constraints, State Equation: 0/1283 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/2092 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 2092 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1283/1422 places, 2093/2128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61568 ms. Remains : 1283/1422 places, 2093/2128 transitions.
Built C files in :
/tmp/ltsmin18086661654157961965
[2025-05-30 08:44:37] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18086661654157961965
Running compilation step : cd /tmp/ltsmin18086661654157961965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18086661654157961965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18086661654157961965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 1422 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Applied a total of 0 rules in 43 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
// Phase 1: matrix 2128 rows 1422 cols
[2025-05-30 08:44:40] [INFO ] Computed 192 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:41] [INFO ] Implicit Places using invariants in 887 ms returned []
[2025-05-30 08:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:45] [INFO ] Implicit Places using invariants and state equation in 3864 ms returned []
Implicit Place search using SMT with State Equation took 4752 ms to find 0 implicit places.
Running 2127 sub problems to find dead transitions.
[2025-05-30 08:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 2127/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 16)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 11)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 8)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 14)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 5)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 2)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 3)
(s201 1)
(s202 2)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 0)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 1)
(s239 1)
(s240 0)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 16)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 11)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 11)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 7)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 8)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 12)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 2)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 3)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 3)
(s382 1)
(s383 2)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 11)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 1)
(s424 0)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 9)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 0)
(s472 0)
(s473 1)
(s474 1)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 1)
(s485 0)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 0)
(s499 1)
(s500 1)
(s501 0)
(s502 0)
(s503 0)
(s504 1)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 4)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 2)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 0)
(s562 3)
(s563 1)
(s564 1)
(s565 1)
(s566 2)
(s567 1)
(s568 1)
(s569 3)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 1)
(s595 1)
(s596 0)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 16)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 8)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 18)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 7)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 5)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 0)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 3)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 3)
(s744 1)
(s745 1)
(s746 1)
(s747 2)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1421/3550 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/44 constraints, Generalized P Invariants (flows): 136/148 constraints, State Equation: 0/1422 constraints, PredecessorRefiner: 0/2127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Finished structural reductions in LTL mode , in 1 iterations and 65453 ms. Remains : 1422/1422 places, 2128/2128 transitions.
Built C files in :
/tmp/ltsmin3711537511461890584
[2025-05-30 08:45:46] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3711537511461890584
Running compilation step : cd /tmp/ltsmin3711537511461890584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3711537511461890584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3711537511461890584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 08:45:49] [INFO ] Flatten gal took : 79 ms
[2025-05-30 08:45:49] [INFO ] Flatten gal took : 70 ms
[2025-05-30 08:45:49] [INFO ] Time to serialize gal into /tmp/LTL7208542816897773732.gal : 18 ms
[2025-05-30 08:45:49] [INFO ] Time to serialize properties into /tmp/LTL9336991373059245681.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7208542816897773732.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13348464048657713436.hoa' '-atoms' '/tmp/LTL9336991373059245681.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9336991373059245681.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13348464048657713436.hoa
Detected timeout of ITS tools.
[2025-05-30 08:46:04] [INFO ] Flatten gal took : 65 ms
[2025-05-30 08:46:04] [INFO ] Flatten gal took : 66 ms
[2025-05-30 08:46:04] [INFO ] Time to serialize gal into /tmp/LTL3982699255461004741.gal : 12 ms
[2025-05-30 08:46:04] [INFO ] Time to serialize properties into /tmp/LTL2233027974603453141.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3982699255461004741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2233027974603453141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(p889==0)"
Detected timeout of ITS tools.
[2025-05-30 08:46:19] [INFO ] Flatten gal took : 58 ms
[2025-05-30 08:46:19] [INFO ] Applying decomposition
[2025-05-30 08:46:20] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11191320662408072582.txt' '-o' '/tmp/graph11191320662408072582.bin' '-w' '/tmp/graph11191320662408072582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11191320662408072582.bin' '-l' '-1' '-v' '-w' '/tmp/graph11191320662408072582.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:46:20] [INFO ] Decomposing Gal with order
[2025-05-30 08:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:46:20] [INFO ] Removed a total of 2841 redundant transitions.
[2025-05-30 08:46:20] [INFO ] Flatten gal took : 238 ms
[2025-05-30 08:46:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 42 ms.
[2025-05-30 08:46:20] [INFO ] Time to serialize gal into /tmp/LTL9987985092116229662.gal : 43 ms
[2025-05-30 08:46:20] [INFO ] Time to serialize properties into /tmp/LTL9031751397007520334.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9987985092116229662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9031751397007520334.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(i11.u250.p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(i11.u250.p889==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-02 finished in 262940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1426 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1426 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1425 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1425 transition count 2128
Applied a total of 34 rules in 790 ms. Remains 1425 /1442 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1425 cols
[2025-05-30 08:46:36] [INFO ] Computed 195 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:37] [INFO ] Implicit Places using invariants in 866 ms returned [934, 1278, 1298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 868 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1442 places, 2128/2265 transitions.
Applied a total of 0 rules in 49 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1709 ms. Remains : 1422/1442 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 648 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 16 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-07a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07a-LTLCardinality-03 finished in 3103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 1441 transition count 1992
Reduce places removed 279 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 286 rules applied. Total rules applied 558 place count 1162 transition count 1985
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 565 place count 1155 transition count 1985
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 565 place count 1155 transition count 1791
Deduced a syphon composed of 194 places in 3 ms
Ensure Unique test removed 59 places
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 3 with 447 rules applied. Total rules applied 1012 place count 902 transition count 1791
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 34 rules applied. Total rules applied 1046 place count 886 transition count 1773
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1064 place count 868 transition count 1773
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 1064 place count 868 transition count 1752
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1106 place count 847 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1116 place count 837 transition count 1734
Iterating global reduction 5 with 10 rules applied. Total rules applied 1126 place count 837 transition count 1734
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 5 with 24 rules applied. Total rules applied 1150 place count 833 transition count 1714
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1163 place count 820 transition count 1714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1163 place count 820 transition count 1713
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1165 place count 819 transition count 1713
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1168 place count 816 transition count 1710
Iterating global reduction 7 with 3 rules applied. Total rules applied 1171 place count 816 transition count 1710
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1174 place count 816 transition count 1707
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 8 with 148 rules applied. Total rules applied 1322 place count 742 transition count 1633
Applied a total of 1322 rules in 183 ms. Remains 742 /1442 variables (removed 700) and now considering 1633/2265 (removed 632) transitions.
// Phase 1: matrix 1633 rows 742 cols
[2025-05-30 08:46:39] [INFO ] Computed 109 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:39] [INFO ] Implicit Places using invariants in 539 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 466, 475, 527, 545, 551, 556, 558, 621, 655, 656, 668, 736, 741]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 540 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 709/1442 places, 1633/2265 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 709 transition count 1630
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 706 transition count 1630
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 706 transition count 1622
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 698 transition count 1622
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 688 transition count 1612
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 688 transition count 1612
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 52 place count 678 transition count 1602
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 678 transition count 1602
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 673 transition count 1597
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 673 transition count 1597
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 658 transition count 1582
Applied a total of 102 rules in 101 ms. Remains 658 /709 variables (removed 51) and now considering 1582/1633 (removed 51) transitions.
// Phase 1: matrix 1582 rows 658 cols
[2025-05-30 08:46:39] [INFO ] Computed 76 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:40] [INFO ] Implicit Places using invariants in 475 ms returned [405, 410, 565, 571, 576]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 478 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 653/1442 places, 1582/2265 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 650 transition count 1579
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 650 transition count 1579
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 647 transition count 1576
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 647 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 646 transition count 1575
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 646 transition count 1575
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 644 transition count 1573
Applied a total of 18 rules in 86 ms. Remains 644 /653 variables (removed 9) and now considering 1573/1582 (removed 9) transitions.
// Phase 1: matrix 1573 rows 644 cols
[2025-05-30 08:46:40] [INFO ] Computed 71 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:40] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-05-30 08:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:42] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 644/1442 places, 1573/2265 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3287 ms. Remains : 644/1442 places, 1573/2265 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-05
Stuttering criterion allowed to conclude after 4871 steps with 58 reset in 17 ms.
FORMULA ASLink-PT-07a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-05 finished in 3369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F(p1))))))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Applied a total of 30 rules in 744 ms. Remains 1427 /1442 variables (removed 15) and now considering 2144/2265 (removed 121) transitions.
// Phase 1: matrix 2144 rows 1427 cols
[2025-05-30 08:46:43] [INFO ] Computed 195 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:44] [INFO ] Implicit Places using invariants in 919 ms returned [934, 1278, 1298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 922 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1424/1442 places, 2144/2265 transitions.
Applied a total of 0 rules in 57 ms. Remains 1424 /1424 variables (removed 0) and now considering 2144/2144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1723 ms. Remains : 1424/1442 places, 2144/2265 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-06
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-06 finished in 1918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!X(p0) U !p1)))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1426 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1426 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1425 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1425 transition count 2128
Applied a total of 34 rules in 879 ms. Remains 1425 /1442 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1425 cols
[2025-05-30 08:46:45] [INFO ] Computed 195 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:46] [INFO ] Implicit Places using invariants in 841 ms returned [934, 1278, 1298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 844 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1442 places, 2128/2265 transitions.
Applied a total of 0 rules in 47 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1771 ms. Remains : 1422/1442 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR p1 p0), p1, p1]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-07
Stuttering criterion allowed to conclude after 188 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-07a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-07 finished in 1944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 1442 transition count 1995
Reduce places removed 270 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 271 rules applied. Total rules applied 541 place count 1172 transition count 1994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 1171 transition count 1994
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 180 Pre rules applied. Total rules applied 542 place count 1171 transition count 1814
Deduced a syphon composed of 180 places in 2 ms
Ensure Unique test removed 59 places
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 419 rules applied. Total rules applied 961 place count 932 transition count 1814
Discarding 7 places :
Implicit places reduction removed 7 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 3 with 8 rules applied. Total rules applied 969 place count 925 transition count 1813
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 970 place count 924 transition count 1813
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 970 place count 924 transition count 1794
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1008 place count 905 transition count 1794
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1011 place count 902 transition count 1783
Iterating global reduction 5 with 3 rules applied. Total rules applied 1014 place count 902 transition count 1783
Discarding 4 places :
Implicit places reduction removed 4 places
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 5 with 17 rules applied. Total rules applied 1031 place count 898 transition count 1770
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1044 place count 885 transition count 1770
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1044 place count 885 transition count 1769
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 1046 place count 884 transition count 1769
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1050 place count 880 transition count 1758
Iterating global reduction 7 with 4 rules applied. Total rules applied 1054 place count 880 transition count 1758
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1057 place count 880 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1058 place count 879 transition count 1747
Iterating global reduction 8 with 1 rules applied. Total rules applied 1059 place count 879 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1060 place count 878 transition count 1739
Iterating global reduction 8 with 1 rules applied. Total rules applied 1061 place count 878 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1062 place count 877 transition count 1731
Iterating global reduction 8 with 1 rules applied. Total rules applied 1063 place count 877 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1064 place count 876 transition count 1723
Iterating global reduction 8 with 1 rules applied. Total rules applied 1065 place count 876 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1066 place count 875 transition count 1715
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 875 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1068 place count 874 transition count 1707
Iterating global reduction 8 with 1 rules applied. Total rules applied 1069 place count 874 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1070 place count 873 transition count 1699
Iterating global reduction 8 with 1 rules applied. Total rules applied 1071 place count 873 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1072 place count 872 transition count 1691
Iterating global reduction 8 with 1 rules applied. Total rules applied 1073 place count 872 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1074 place count 871 transition count 1683
Iterating global reduction 8 with 1 rules applied. Total rules applied 1075 place count 871 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1076 place count 870 transition count 1675
Iterating global reduction 8 with 1 rules applied. Total rules applied 1077 place count 870 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1078 place count 869 transition count 1667
Iterating global reduction 8 with 1 rules applied. Total rules applied 1079 place count 869 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1080 place count 868 transition count 1659
Iterating global reduction 8 with 1 rules applied. Total rules applied 1081 place count 868 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1082 place count 867 transition count 1651
Iterating global reduction 8 with 1 rules applied. Total rules applied 1083 place count 867 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1084 place count 866 transition count 1643
Iterating global reduction 8 with 1 rules applied. Total rules applied 1085 place count 866 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1086 place count 865 transition count 1635
Iterating global reduction 8 with 1 rules applied. Total rules applied 1087 place count 865 transition count 1635
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 8 with 164 rules applied. Total rules applied 1251 place count 783 transition count 1553
Applied a total of 1251 rules in 475 ms. Remains 783 /1442 variables (removed 659) and now considering 1553/2265 (removed 712) transitions.
// Phase 1: matrix 1553 rows 783 cols
[2025-05-30 08:46:46] [INFO ] Computed 125 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:47] [INFO ] Implicit Places using invariants in 591 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 284, 290, 298, 317, 387, 393, 398, 414, 521, 592, 598, 603, 622, 713, 727, 728, 780]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 593 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/1442 places, 1553/2265 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 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 1551
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 756 transition count 1551
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 4 place count 756 transition count 1533
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 40 place count 738 transition count 1533
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 49 place count 729 transition count 1524
Iterating global reduction 2 with 9 rules applied. Total rules applied 58 place count 729 transition count 1524
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 720 transition count 1515
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 720 transition count 1515
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 715 transition count 1510
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 715 transition count 1510
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 114 place count 701 transition count 1496
Applied a total of 114 rules in 101 ms. Remains 701 /758 variables (removed 57) and now considering 1496/1553 (removed 57) transitions.
// Phase 1: matrix 1496 rows 701 cols
[2025-05-30 08:46:47] [INFO ] Computed 100 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:47] [INFO ] Implicit Places using invariants in 494 ms returned [93, 96, 177, 180, 269, 272, 353, 356, 456, 459, 541, 544, 621, 627, 632, 634, 637]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 495 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 684/1442 places, 1496/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 684 transition count 1489
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 677 transition count 1489
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 23 place count 668 transition count 1480
Iterating global reduction 2 with 9 rules applied. Total rules applied 32 place count 668 transition count 1480
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 39 place count 668 transition count 1473
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 666 transition count 1471
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 666 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 665 transition count 1470
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 665 transition count 1470
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 3 with 4 rules applied. Total rules applied 49 place count 663 transition count 1468
Applied a total of 49 rules in 90 ms. Remains 663 /684 variables (removed 21) and now considering 1468/1496 (removed 28) transitions.
// Phase 1: matrix 1468 rows 663 cols
[2025-05-30 08:46:48] [INFO ] Computed 83 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:48] [INFO ] Implicit Places using invariants in 443 ms returned [72, 151, 231, 319, 399, 499, 579]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 444 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 656/1442 places, 1468/2265 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 649 transition count 1461
Applied a total of 14 rules in 38 ms. Remains 649 /656 variables (removed 7) and now considering 1461/1468 (removed 7) transitions.
// Phase 1: matrix 1461 rows 649 cols
[2025-05-30 08:46:48] [INFO ] Computed 76 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:48] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-05-30 08:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 08:46:50] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 649/1442 places, 1461/2265 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4169 ms. Remains : 649/1442 places, 1461/2265 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-08
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-08 finished in 4308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 1441 transition count 1992
Reduce places removed 279 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 286 rules applied. Total rules applied 558 place count 1162 transition count 1985
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 566 place count 1155 transition count 1984
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 567 place count 1154 transition count 1984
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 196 Pre rules applied. Total rules applied 567 place count 1154 transition count 1788
Deduced a syphon composed of 196 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 4 with 453 rules applied. Total rules applied 1020 place count 897 transition count 1788
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 1054 place count 882 transition count 1769
Reduce places removed 20 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 5 with 22 rules applied. Total rules applied 1076 place count 862 transition count 1767
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1078 place count 860 transition count 1767
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 1078 place count 860 transition count 1742
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1128 place count 835 transition count 1742
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1138 place count 825 transition count 1724
Iterating global reduction 7 with 10 rules applied. Total rules applied 1148 place count 825 transition count 1724
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 7 with 24 rules applied. Total rules applied 1172 place count 821 transition count 1704
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1185 place count 808 transition count 1704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1185 place count 808 transition count 1703
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1187 place count 807 transition count 1703
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1191 place count 803 transition count 1692
Iterating global reduction 9 with 4 rules applied. Total rules applied 1195 place count 803 transition count 1692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1198 place count 803 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1199 place count 802 transition count 1681
Iterating global reduction 10 with 1 rules applied. Total rules applied 1200 place count 802 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1201 place count 801 transition count 1673
Iterating global reduction 10 with 1 rules applied. Total rules applied 1202 place count 801 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1203 place count 800 transition count 1665
Iterating global reduction 10 with 1 rules applied. Total rules applied 1204 place count 800 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1205 place count 799 transition count 1657
Iterating global reduction 10 with 1 rules applied. Total rules applied 1206 place count 799 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1207 place count 798 transition count 1649
Iterating global reduction 10 with 1 rules applied. Total rules applied 1208 place count 798 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1209 place count 797 transition count 1641
Iterating global reduction 10 with 1 rules applied. Total rules applied 1210 place count 797 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1211 place count 796 transition count 1633
Iterating global reduction 10 with 1 rules applied. Total rules applied 1212 place count 796 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1213 place count 795 transition count 1625
Iterating global reduction 10 with 1 rules applied. Total rules applied 1214 place count 795 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1215 place count 794 transition count 1617
Iterating global reduction 10 with 1 rules applied. Total rules applied 1216 place count 794 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1217 place count 793 transition count 1609
Iterating global reduction 10 with 1 rules applied. Total rules applied 1218 place count 793 transition count 1609
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1219 place count 792 transition count 1601
Iterating global reduction 10 with 1 rules applied. Total rules applied 1220 place count 792 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1221 place count 791 transition count 1593
Iterating global reduction 10 with 1 rules applied. Total rules applied 1222 place count 791 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1223 place count 790 transition count 1585
Iterating global reduction 10 with 1 rules applied. Total rules applied 1224 place count 790 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1225 place count 789 transition count 1577
Iterating global reduction 10 with 1 rules applied. Total rules applied 1226 place count 789 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1227 place count 788 transition count 1569
Iterating global reduction 10 with 1 rules applied. Total rules applied 1228 place count 788 transition count 1569
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 10 with 146 rules applied. Total rules applied 1374 place count 715 transition count 1496
Applied a total of 1374 rules in 435 ms. Remains 715 /1442 variables (removed 727) and now considering 1496/2265 (removed 769) transitions.
// Phase 1: matrix 1496 rows 715 cols
[2025-05-30 08:46:51] [INFO ] Computed 107 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:51] [INFO ] Implicit Places using invariants in 496 ms returned [72, 89, 95, 101, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 460, 520, 537, 543, 548, 550, 613, 647, 648, 660, 712]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 498 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 681/1442 places, 1496/2265 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 681 transition count 1495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 680 transition count 1495
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 680 transition count 1491
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 676 transition count 1491
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 22 place count 664 transition count 1479
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 664 transition count 1479
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 46 place count 652 transition count 1467
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 652 transition count 1467
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 646 transition count 1461
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 646 transition count 1461
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 631 transition count 1446
Applied a total of 100 rules in 93 ms. Remains 631 /681 variables (removed 50) and now considering 1446/1496 (removed 50) transitions.
// Phase 1: matrix 1446 rows 631 cols
[2025-05-30 08:46:51] [INFO ] Computed 73 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:52] [INFO ] Implicit Places using invariants in 411 ms returned [555, 561, 566]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 412 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 628/1442 places, 1446/2265 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1444
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 624 transition count 1442
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 624 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 623 transition count 1441
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 623 transition count 1441
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 12 place count 622 transition count 1440
Applied a total of 12 rules in 81 ms. Remains 622 /628 variables (removed 6) and now considering 1440/1446 (removed 6) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2025-05-30 08:46:52] [INFO ] Computed 70 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:52] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-30 08:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:53] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 622/1442 places, 1440/2265 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3187 ms. Remains : 622/1442 places, 1440/2265 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-09
Product exploration explored 100000 steps with 1357 reset in 219 ms.
Product exploration explored 100000 steps with 1276 reset in 278 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 91 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 25 ms :[(NOT p0)]
RANDOM walk for 221 steps (2 resets) in 4 ms. (44 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 72 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Applied a total of 0 rules in 26 ms. Remains 622 /622 variables (removed 0) and now considering 1440/1440 (removed 0) transitions.
[2025-05-30 08:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:54] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-05-30 08:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:56] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:46:56] [INFO ] Redundant transitions in 48 ms returned []
Running 1399 sub problems to find dead transitions.
[2025-05-30 08:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 1399/1399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/1399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1399 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62085 ms. Remains : 622/622 places, 1440/1440 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 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 223 steps (1 resets) in 6 ms. (31 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 97 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1280 reset in 218 ms.
Product exploration explored 100000 steps with 1266 reset in 229 ms.
Built C files in :
/tmp/ltsmin1072826311101366151
[2025-05-30 08:47:57] [INFO ] Computing symmetric may disable matrix : 1440 transitions.
[2025-05-30 08:47:57] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:47:57] [INFO ] Computing symmetric may enable matrix : 1440 transitions.
[2025-05-30 08:47:57] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:47:57] [INFO ] Computing Do-Not-Accords matrix : 1440 transitions.
[2025-05-30 08:47:57] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:47:57] [INFO ] Built C files in 439ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1072826311101366151
Running compilation step : cd /tmp/ltsmin1072826311101366151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1072826311101366151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1072826311101366151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Applied a total of 0 rules in 26 ms. Remains 622 /622 variables (removed 0) and now considering 1440/1440 (removed 0) transitions.
[2025-05-30 08:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:48:01] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-05-30 08:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:48:02] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:48:02] [INFO ] Redundant transitions in 28 ms returned []
Running 1399 sub problems to find dead transitions.
[2025-05-30 08:48:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 1399/1399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/1399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 1399 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62156 ms. Remains : 622/622 places, 1440/1440 transitions.
Built C files in :
/tmp/ltsmin7364299970725923344
[2025-05-30 08:49:03] [INFO ] Computing symmetric may disable matrix : 1440 transitions.
[2025-05-30 08:49:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:49:03] [INFO ] Computing symmetric may enable matrix : 1440 transitions.
[2025-05-30 08:49:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:49:03] [INFO ] Computing Do-Not-Accords matrix : 1440 transitions.
[2025-05-30 08:49:03] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:49:03] [INFO ] Built C files in 375ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7364299970725923344
Running compilation step : cd /tmp/ltsmin7364299970725923344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7364299970725923344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7364299970725923344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 08:49:06] [INFO ] Flatten gal took : 45 ms
[2025-05-30 08:49:06] [INFO ] Flatten gal took : 59 ms
[2025-05-30 08:49:06] [INFO ] Time to serialize gal into /tmp/LTL2885292597968125532.gal : 7 ms
[2025-05-30 08:49:06] [INFO ] Time to serialize properties into /tmp/LTL6419395514957700884.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2885292597968125532.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15897849050699924844.hoa' '-atoms' '/tmp/LTL6419395514957700884.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6419395514957700884.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15897849050699924844.hoa
Detected timeout of ITS tools.
[2025-05-30 08:49:21] [INFO ] Flatten gal took : 42 ms
[2025-05-30 08:49:21] [INFO ] Flatten gal took : 41 ms
[2025-05-30 08:49:21] [INFO ] Time to serialize gal into /tmp/LTL13548020437628468860.gal : 6 ms
[2025-05-30 08:49:21] [INFO ] Time to serialize properties into /tmp/LTL9378469610147279633.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13548020437628468860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9378469610147279633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1188==0)||(p175==1))"))))
Formula 0 simplified : GF!"((p1188==0)||(p175==1))"
Detected timeout of ITS tools.
[2025-05-30 08:49:37] [INFO ] Flatten gal took : 35 ms
[2025-05-30 08:49:37] [INFO ] Applying decomposition
[2025-05-30 08:49:37] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9612568077134979662.txt' '-o' '/tmp/graph9612568077134979662.bin' '-w' '/tmp/graph9612568077134979662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9612568077134979662.bin' '-l' '-1' '-v' '-w' '/tmp/graph9612568077134979662.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:49:37] [INFO ] Decomposing Gal with order
[2025-05-30 08:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:49:37] [INFO ] Removed a total of 2880 redundant transitions.
[2025-05-30 08:49:37] [INFO ] Flatten gal took : 72 ms
[2025-05-30 08:49:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 23 ms.
[2025-05-30 08:49:37] [INFO ] Time to serialize gal into /tmp/LTL12979492249871208671.gal : 14 ms
[2025-05-30 08:49:37] [INFO ] Time to serialize properties into /tmp/LTL13110037771781850642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12979492249871208671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13110037771781850642.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i13.u136.p1188==0)||(i1.u24.p175==1))"))))
Formula 0 simplified : GF!"((i13.u136.p1188==0)||(i1.u24.p175==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-09 finished in 181812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((G(p1)||F(p2))))))'
Support contains 3 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1441 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1441 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1440 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1440 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1439 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1439 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1438 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1438 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1437 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1437 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1436 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1436 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1435 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1435 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1434 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1434 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1433 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1433 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1432 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1432 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1431 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1431 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1430 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1430 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1429 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1429 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1428 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1428 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1427 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1427 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1426 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1426 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1425 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1425 transition count 2128
Applied a total of 34 rules in 808 ms. Remains 1425 /1442 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1425 cols
[2025-05-30 08:49:53] [INFO ] Computed 195 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:54] [INFO ] Implicit Places using invariants in 866 ms returned [934, 1278, 1298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 868 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1442 places, 2128/2265 transitions.
Applied a total of 0 rules in 47 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1723 ms. Remains : 1422/1442 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-12
Stuttering criterion allowed to conclude after 1139 steps with 5 reset in 5 ms.
FORMULA ASLink-PT-07a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-12 finished in 1965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 273 place count 1441 transition count 1991
Reduce places removed 280 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 287 rules applied. Total rules applied 560 place count 1161 transition count 1984
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 567 place count 1154 transition count 1984
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 195 Pre rules applied. Total rules applied 567 place count 1154 transition count 1789
Deduced a syphon composed of 195 places in 1 ms
Ensure Unique test removed 61 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 3 with 451 rules applied. Total rules applied 1018 place count 898 transition count 1789
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 3 with 34 rules applied. Total rules applied 1052 place count 883 transition count 1770
Reduce places removed 20 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 4 with 22 rules applied. Total rules applied 1074 place count 863 transition count 1768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1076 place count 861 transition count 1768
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1076 place count 861 transition count 1743
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1126 place count 836 transition count 1743
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1135 place count 827 transition count 1734
Iterating global reduction 6 with 9 rules applied. Total rules applied 1144 place count 827 transition count 1734
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 1152 place count 827 transition count 1726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1153 place count 826 transition count 1726
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1153 place count 826 transition count 1725
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1155 place count 825 transition count 1725
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 8 with 164 rules applied. Total rules applied 1319 place count 743 transition count 1643
Applied a total of 1319 rules in 122 ms. Remains 743 /1442 variables (removed 699) and now considering 1643/2265 (removed 622) transitions.
// Phase 1: matrix 1643 rows 743 cols
[2025-05-30 08:49:54] [INFO ] Computed 111 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:55] [INFO ] Implicit Places using invariants in 531 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 612, 647, 648, 660, 728, 731, 734, 737, 740]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 533 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1442 places, 1643/2265 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 705 transition count 1642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 704 transition count 1642
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 704 transition count 1638
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 700 transition count 1638
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 25 place count 685 transition count 1623
Iterating global reduction 2 with 15 rules applied. Total rules applied 40 place count 685 transition count 1623
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 55 place count 670 transition count 1605
Iterating global reduction 2 with 15 rules applied. Total rules applied 70 place count 670 transition count 1605
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 670 transition count 1602
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 79 place count 664 transition count 1596
Iterating global reduction 3 with 6 rules applied. Total rules applied 85 place count 664 transition count 1596
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 119 place count 647 transition count 1579
Applied a total of 119 rules in 95 ms. Remains 647 /705 variables (removed 58) and now considering 1579/1643 (removed 64) transitions.
// Phase 1: matrix 1579 rows 647 cols
[2025-05-30 08:49:55] [INFO ] Computed 73 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:55] [INFO ] Implicit Places using invariants in 431 ms returned [553, 559, 565]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 433 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 644/1442 places, 1579/2265 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1577
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 640 transition count 1575
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 640 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 639 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 639 transition count 1574
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 12 place count 638 transition count 1573
Applied a total of 12 rules in 81 ms. Remains 638 /644 variables (removed 6) and now considering 1573/1579 (removed 6) transitions.
// Phase 1: matrix 1573 rows 638 cols
[2025-05-30 08:49:55] [INFO ] Computed 70 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:56] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-05-30 08:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:57] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 638/1442 places, 1573/2265 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2994 ms. Remains : 638/1442 places, 1573/2265 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-14
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-07a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-14 finished in 3118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Found a Lengthening insensitive property : ASLink-PT-07a-LTLCardinality-02
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1442 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1442/1442 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 1441 transition count 1993
Reduce places removed 278 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 285 rules applied. Total rules applied 556 place count 1163 transition count 1986
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 564 place count 1156 transition count 1985
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 565 place count 1155 transition count 1985
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 196 Pre rules applied. Total rules applied 565 place count 1155 transition count 1789
Deduced a syphon composed of 196 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 4 with 453 rules applied. Total rules applied 1018 place count 898 transition count 1789
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 1052 place count 883 transition count 1770
Reduce places removed 20 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 5 with 22 rules applied. Total rules applied 1074 place count 863 transition count 1768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1076 place count 861 transition count 1768
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 1076 place count 861 transition count 1743
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1126 place count 836 transition count 1743
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1136 place count 826 transition count 1725
Iterating global reduction 7 with 10 rules applied. Total rules applied 1146 place count 826 transition count 1725
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 7 with 24 rules applied. Total rules applied 1170 place count 822 transition count 1705
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1183 place count 809 transition count 1705
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1183 place count 809 transition count 1704
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1185 place count 808 transition count 1704
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1189 place count 804 transition count 1693
Iterating global reduction 9 with 4 rules applied. Total rules applied 1193 place count 804 transition count 1693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1196 place count 804 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1197 place count 803 transition count 1682
Iterating global reduction 10 with 1 rules applied. Total rules applied 1198 place count 803 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1199 place count 802 transition count 1674
Iterating global reduction 10 with 1 rules applied. Total rules applied 1200 place count 802 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1201 place count 801 transition count 1666
Iterating global reduction 10 with 1 rules applied. Total rules applied 1202 place count 801 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1203 place count 800 transition count 1658
Iterating global reduction 10 with 1 rules applied. Total rules applied 1204 place count 800 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1205 place count 799 transition count 1650
Iterating global reduction 10 with 1 rules applied. Total rules applied 1206 place count 799 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1207 place count 798 transition count 1642
Iterating global reduction 10 with 1 rules applied. Total rules applied 1208 place count 798 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1209 place count 797 transition count 1634
Iterating global reduction 10 with 1 rules applied. Total rules applied 1210 place count 797 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1211 place count 796 transition count 1626
Iterating global reduction 10 with 1 rules applied. Total rules applied 1212 place count 796 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1213 place count 795 transition count 1618
Iterating global reduction 10 with 1 rules applied. Total rules applied 1214 place count 795 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1215 place count 794 transition count 1610
Iterating global reduction 10 with 1 rules applied. Total rules applied 1216 place count 794 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1217 place count 793 transition count 1602
Iterating global reduction 10 with 1 rules applied. Total rules applied 1218 place count 793 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1219 place count 792 transition count 1594
Iterating global reduction 10 with 1 rules applied. Total rules applied 1220 place count 792 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1221 place count 791 transition count 1586
Iterating global reduction 10 with 1 rules applied. Total rules applied 1222 place count 791 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1223 place count 790 transition count 1578
Iterating global reduction 10 with 1 rules applied. Total rules applied 1224 place count 790 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1225 place count 789 transition count 1570
Iterating global reduction 10 with 1 rules applied. Total rules applied 1226 place count 789 transition count 1570
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 10 with 148 rules applied. Total rules applied 1374 place count 715 transition count 1496
Applied a total of 1374 rules in 444 ms. Remains 715 /1442 variables (removed 727) and now considering 1496/2265 (removed 769) transitions.
// Phase 1: matrix 1496 rows 715 cols
[2025-05-30 08:49:58] [INFO ] Computed 107 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:58] [INFO ] Implicit Places using invariants in 514 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 447, 453, 458, 460, 520, 537, 543, 548, 550, 613, 647, 648, 660, 712]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 519 ms to find 34 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 681/1442 places, 1496/2265 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 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 679 transition count 1494
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 679 transition count 1490
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 675 transition count 1490
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 24 place count 663 transition count 1478
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 663 transition count 1478
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 48 place count 651 transition count 1466
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 651 transition count 1466
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 645 transition count 1460
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 645 transition count 1460
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 630 transition count 1445
Applied a total of 102 rules in 90 ms. Remains 630 /681 variables (removed 51) and now considering 1445/1496 (removed 51) transitions.
// Phase 1: matrix 1445 rows 630 cols
[2025-05-30 08:49:58] [INFO ] Computed 73 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:59] [INFO ] Implicit Places using invariants in 416 ms returned [554, 560, 565]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 417 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 627/1442 places, 1445/2265 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 625 transition count 1443
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 625 transition count 1443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 623 transition count 1441
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 623 transition count 1441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 622 transition count 1440
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 622 transition count 1440
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 0 with 2 rules applied. Total rules applied 12 place count 621 transition count 1439
Applied a total of 12 rules in 78 ms. Remains 621 /627 variables (removed 6) and now considering 1439/1445 (removed 6) transitions.
// Phase 1: matrix 1439 rows 621 cols
[2025-05-30 08:49:59] [INFO ] Computed 70 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:59] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-05-30 08:49:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:50:00] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 621/1442 places, 1439/2265 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3120 ms. Remains : 621/1442 places, 1439/2265 transitions.
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-02
Product exploration explored 100000 steps with 1297 reset in 209 ms.
Product exploration explored 100000 steps with 1334 reset in 216 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (517 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (96 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443107 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443107 steps, saw 91653 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2025-05-30 08:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/123 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/396 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/451 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/615 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/619 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2060/2060 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/123 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/396 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/451 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/615 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/619 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2060 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2060 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2060 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2060/2060 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1110ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 621 transition count 1411
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 593 transition count 1404
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 84 place count 593 transition count 1383
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 105 place count 572 transition count 1383
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 106 place count 572 transition count 1383
Applied a total of 106 rules in 77 ms. Remains 572 /621 variables (removed 49) and now considering 1383/1439 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 572/621 places, 1383/1439 transitions.
RANDOM walk for 40000 steps (686 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (133 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 124463 steps, run visited all 1 properties in 1159 ms. (steps per millisecond=107 )
Probabilistic random walk after 124463 steps, saw 69779 distinct states, run finished after 1159 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 19 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
[2025-05-30 08:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:50:08] [INFO ] Implicit Places using invariants in 381 ms returned []
[2025-05-30 08:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:50:09] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Running 1398 sub problems to find dead transitions.
[2025-05-30 08:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in LTL mode , in 1 iterations and 61959 ms. Remains : 621/621 places, 1439/1439 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (522 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (100 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443825 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443825 steps, saw 91869 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2025-05-30 08:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/123 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/396 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/451 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/615 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/619 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2060/2060 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/123 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/396 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/451 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 164/615 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/619 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2060 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2060 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2060 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2060/2060 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 621 transition count 1411
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 593 transition count 1404
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 84 place count 593 transition count 1383
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 105 place count 572 transition count 1383
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 106 place count 572 transition count 1383
Applied a total of 106 rules in 76 ms. Remains 572 /621 variables (removed 49) and now considering 1383/1439 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 572/621 places, 1383/1439 transitions.
RANDOM walk for 40000 steps (727 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 124463 steps, run visited all 1 properties in 1150 ms. (steps per millisecond=108 )
Probabilistic random walk after 124463 steps, saw 69779 distinct states, run finished after 1151 ms. (steps per millisecond=108 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1285 reset in 206 ms.
Product exploration explored 100000 steps with 1381 reset in 220 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 29 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:51:17] [INFO ] Redundant transitions in 25 ms returned []
Running 1398 sub problems to find dead transitions.
[2025-05-30 08:51:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60496 ms. Remains : 621/621 places, 1439/1439 transitions.
Built C files in :
/tmp/ltsmin8990628103460358285
[2025-05-30 08:52:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8990628103460358285
Running compilation step : cd /tmp/ltsmin8990628103460358285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2588 ms.
Running link step : cd /tmp/ltsmin8990628103460358285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8990628103460358285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8148032118651317135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 20 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
[2025-05-30 08:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:52:33] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-30 08:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:52:34] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 1398 sub problems to find dead transitions.
[2025-05-30 08:52:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2060 variables, and 66 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in LTL mode , in 1 iterations and 62025 ms. Remains : 621/621 places, 1439/1439 transitions.
Built C files in :
/tmp/ltsmin17521598813213201764
[2025-05-30 08:53:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17521598813213201764
Running compilation step : cd /tmp/ltsmin17521598813213201764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2620 ms.
Running link step : cd /tmp/ltsmin17521598813213201764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17521598813213201764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10211656439430417991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 08:53:49] [INFO ] Flatten gal took : 35 ms
[2025-05-30 08:53:49] [INFO ] Flatten gal took : 34 ms
[2025-05-30 08:53:50] [INFO ] Time to serialize gal into /tmp/LTL1444353429137684665.gal : 6 ms
[2025-05-30 08:53:50] [INFO ] Time to serialize properties into /tmp/LTL10488943211315506985.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1444353429137684665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3837777930264040901.hoa' '-atoms' '/tmp/LTL10488943211315506985.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10488943211315506985.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3837777930264040901.hoa
Detected timeout of ITS tools.
[2025-05-30 08:54:05] [INFO ] Flatten gal took : 34 ms
[2025-05-30 08:54:05] [INFO ] Flatten gal took : 35 ms
[2025-05-30 08:54:05] [INFO ] Time to serialize gal into /tmp/LTL9796067121978364330.gal : 7 ms
[2025-05-30 08:54:05] [INFO ] Time to serialize properties into /tmp/LTL11564454421050903528.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9796067121978364330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11564454421050903528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(p889==0)"
Detected timeout of ITS tools.
[2025-05-30 08:54:20] [INFO ] Flatten gal took : 36 ms
[2025-05-30 08:54:20] [INFO ] Applying decomposition
[2025-05-30 08:54:20] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15956418149949220517.txt' '-o' '/tmp/graph15956418149949220517.bin' '-w' '/tmp/graph15956418149949220517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15956418149949220517.bin' '-l' '-1' '-v' '-w' '/tmp/graph15956418149949220517.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:54:20] [INFO ] Decomposing Gal with order
[2025-05-30 08:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:54:20] [INFO ] Removed a total of 2897 redundant transitions.
[2025-05-30 08:54:20] [INFO ] Flatten gal took : 63 ms
[2025-05-30 08:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 13 ms.
[2025-05-30 08:54:20] [INFO ] Time to serialize gal into /tmp/LTL9108210596008887094.gal : 8 ms
[2025-05-30 08:54:20] [INFO ] Time to serialize properties into /tmp/LTL1665808495607346283.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9108210596008887094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1665808495607346283.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(i8.u102.p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(i8.u102.p889==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-02 finished in 278056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-05-30 08:54:35] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1228074623916719025
[2025-05-30 08:54:35] [INFO ] Too many transitions (2265) to apply POR reductions. Disabling POR matrices.
[2025-05-30 08:54:35] [INFO ] Applying decomposition
[2025-05-30 08:54:35] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1228074623916719025
Running compilation step : cd /tmp/ltsmin1228074623916719025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 08:54:35] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6057156362080876014.txt' '-o' '/tmp/graph6057156362080876014.bin' '-w' '/tmp/graph6057156362080876014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6057156362080876014.bin' '-l' '-1' '-v' '-w' '/tmp/graph6057156362080876014.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:54:35] [INFO ] Decomposing Gal with order
[2025-05-30 08:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:54:36] [INFO ] Removed a total of 3233 redundant transitions.
[2025-05-30 08:54:36] [INFO ] Flatten gal took : 107 ms
[2025-05-30 08:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 19 ms.
[2025-05-30 08:54:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality11932477492446730403.gal : 18 ms
[2025-05-30 08:54:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality4385287702007429865.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11932477492446730403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4385287702007429865.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(i8.i0.u251.p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(i8.i0.u251.p889==0)"
Compilation finished in 4716 ms.
Running link step : cd /tmp/ltsmin1228074623916719025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1228074623916719025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1228074623916719025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1228074623916719025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 09:19:36] [INFO ] Applying decomposition
[2025-05-30 09:19:36] [INFO ] Flatten gal took : 102 ms
[2025-05-30 09:19:36] [INFO ] Decomposing Gal with order
[2025-05-30 09:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 09:19:36] [INFO ] Removed a total of 2657 redundant transitions.
[2025-05-30 09:19:36] [INFO ] Flatten gal took : 323 ms
[2025-05-30 09:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 930 labels/synchronizations in 117 ms.
[2025-05-30 09:19:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality11266197140785935012.gal : 35 ms
[2025-05-30 09:19:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality3727231821176485914.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11266197140785935012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3727231821176485914.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(i37.i1.u331.p889==0)"))))))))
Formula 0 simplified : XXXXXF!"(i37.i1.u331.p889==0)"
LTSmin run took 807705 ms.
FORMULA ASLink-PT-07a-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1228074623916719025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-07a, 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 r002-tall-174853729100379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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