Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531700147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717230506065

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:28:27] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-06-01 08:28:27] [INFO ] Transformed 1837 places.
[2024-06-01 08:28:27] [INFO ] Transformed 3460 transitions.
[2024-06-01 08:28:27] [INFO ] Found NUPN structural information;
[2024-06-01 08:28:27] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-05b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 139 place count 1698 transition count 3321
Iterating global reduction 0 with 139 rules applied. Total rules applied 278 place count 1698 transition count 3321
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 362 place count 1614 transition count 3237
Iterating global reduction 0 with 84 rules applied. Total rules applied 446 place count 1614 transition count 3237
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 498 place count 1562 transition count 3185
Iterating global reduction 0 with 52 rules applied. Total rules applied 550 place count 1562 transition count 3185
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 595 place count 1517 transition count 3140
Iterating global reduction 0 with 45 rules applied. Total rules applied 640 place count 1517 transition count 3140
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 681 place count 1476 transition count 3099
Iterating global reduction 0 with 41 rules applied. Total rules applied 722 place count 1476 transition count 3099
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 763 place count 1435 transition count 3058
Iterating global reduction 0 with 41 rules applied. Total rules applied 804 place count 1435 transition count 3058
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 845 place count 1394 transition count 3017
Iterating global reduction 0 with 41 rules applied. Total rules applied 886 place count 1394 transition count 3017
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 927 place count 1353 transition count 2976
Iterating global reduction 0 with 41 rules applied. Total rules applied 968 place count 1353 transition count 2976
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 1001 place count 1320 transition count 2943
Iterating global reduction 0 with 33 rules applied. Total rules applied 1034 place count 1320 transition count 2943
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1061 place count 1293 transition count 2916
Iterating global reduction 0 with 27 rules applied. Total rules applied 1088 place count 1293 transition count 2916
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1093 place count 1293 transition count 2911
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1103 place count 1283 transition count 2901
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 1283 transition count 2901
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1123 place count 1273 transition count 2891
Iterating global reduction 1 with 10 rules applied. Total rules applied 1133 place count 1273 transition count 2891
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1136 place count 1270 transition count 2888
Iterating global reduction 1 with 3 rules applied. Total rules applied 1139 place count 1270 transition count 2888
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1142 place count 1267 transition count 2885
Iterating global reduction 1 with 3 rules applied. Total rules applied 1145 place count 1267 transition count 2885
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1148 place count 1264 transition count 2882
Iterating global reduction 1 with 3 rules applied. Total rules applied 1151 place count 1264 transition count 2882
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1154 place count 1261 transition count 2879
Iterating global reduction 1 with 3 rules applied. Total rules applied 1157 place count 1261 transition count 2879
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1160 place count 1258 transition count 2876
Iterating global reduction 1 with 3 rules applied. Total rules applied 1163 place count 1258 transition count 2876
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1165 place count 1256 transition count 2874
Iterating global reduction 1 with 2 rules applied. Total rules applied 1167 place count 1256 transition count 2874
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1169 place count 1254 transition count 2872
Iterating global reduction 1 with 2 rules applied. Total rules applied 1171 place count 1254 transition count 2872
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1173 place count 1252 transition count 2870
Iterating global reduction 1 with 2 rules applied. Total rules applied 1175 place count 1252 transition count 2870
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1177 place count 1250 transition count 2868
Iterating global reduction 1 with 2 rules applied. Total rules applied 1179 place count 1250 transition count 2868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1180 place count 1249 transition count 2867
Iterating global reduction 1 with 1 rules applied. Total rules applied 1181 place count 1249 transition count 2867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1182 place count 1249 transition count 2866
Applied a total of 1182 rules in 1903 ms. Remains 1249 /1837 variables (removed 588) and now considering 2866/3460 (removed 594) transitions.
// Phase 1: matrix 2866 rows 1249 cols
[2024-06-01 08:28:29] [INFO ] Computed 7 invariants in 61 ms
[2024-06-01 08:28:30] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-06-01 08:28:30] [INFO ] Invariant cache hit.
[2024-06-01 08:28:31] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Running 2865 sub problems to find dead transitions.
[2024-06-01 08:28:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1248/4115 variables, and 0 constraints, problems are : Problem set: 0 solved, 2865 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 2865/2865 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1248/4115 variables, and 0 constraints, problems are : Problem set: 0 solved, 2865 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/2865 constraints, Known Traps: 0/0 constraints]
After SMT, in 80720ms problems are : Problem set: 0 solved, 2865 unsolved
Search for dead transitions found 0 dead transitions in 80776ms
Starting structural reductions in LTL mode, iteration 1 : 1249/1837 places, 2866/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84899 ms. Remains : 1249/1837 places, 2866/3460 transitions.
Support contains 43 out of 1249 places after structural reductions.
[2024-06-01 08:29:53] [INFO ] Flatten gal took : 290 ms
[2024-06-01 08:29:53] [INFO ] Flatten gal took : 179 ms
[2024-06-01 08:29:53] [INFO ] Input system was already deterministic with 2866 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (354 resets) in 1708 ms. (23 steps per ms) remains 12/26 properties
BEST_FIRST walk for 40003 steps (57 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (56 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (58 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (58 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
[2024-06-01 08:29:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1214/1235 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/1249 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2866/4115 variables, 1249/1256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4115 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/4115 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4115/4115 variables, and 1256 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1214/1235 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 08:29:58] [INFO ] Deduced a trap composed of 301 places in 1057 ms of which 72 ms to minimize.
[2024-06-01 08:29:59] [INFO ] Deduced a trap composed of 306 places in 872 ms of which 17 ms to minimize.
[2024-06-01 08:30:00] [INFO ] Deduced a trap composed of 300 places in 849 ms of which 7 ms to minimize.
[2024-06-01 08:30:01] [INFO ] Deduced a trap composed of 312 places in 771 ms of which 6 ms to minimize.
[2024-06-01 08:30:01] [INFO ] Deduced a trap composed of 324 places in 754 ms of which 5 ms to minimize.
[2024-06-01 08:30:03] [INFO ] Deduced a trap composed of 391 places in 841 ms of which 6 ms to minimize.
SMT process timed out in 8141ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Graph (trivial) has 1209 edges and 1249 vertex of which 81 / 1249 are part of one of the 15 SCC in 10 ms
Free SCC test removed 66 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 2141 edges and 1183 vertex of which 1177 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 855 transitions
Trivial Post-agglo rules discarded 855 transitions
Performed 855 trivial Post agglomeration. Transition count delta: 855
Iterating post reduction 0 with 861 rules applied. Total rules applied 863 place count 1177 transition count 1916
Reduce places removed 855 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 878 rules applied. Total rules applied 1741 place count 322 transition count 1893
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 1757 place count 312 transition count 1887
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 1765 place count 306 transition count 1885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1766 place count 305 transition count 1885
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 67 Pre rules applied. Total rules applied 1766 place count 305 transition count 1818
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 1900 place count 238 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1902 place count 236 transition count 1816
Iterating global reduction 5 with 2 rules applied. Total rules applied 1904 place count 236 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1905 place count 235 transition count 1815
Iterating global reduction 5 with 1 rules applied. Total rules applied 1906 place count 235 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1907 place count 234 transition count 1814
Iterating global reduction 5 with 1 rules applied. Total rules applied 1908 place count 234 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1909 place count 233 transition count 1813
Iterating global reduction 5 with 1 rules applied. Total rules applied 1910 place count 233 transition count 1813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1911 place count 233 transition count 1812
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 2001 place count 188 transition count 1767
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2010 place count 188 transition count 1758
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 2040 place count 158 transition count 461
Iterating global reduction 7 with 30 rules applied. Total rules applied 2070 place count 158 transition count 461
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 2087 place count 158 transition count 444
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 2099 place count 146 transition count 432
Iterating global reduction 8 with 12 rules applied. Total rules applied 2111 place count 146 transition count 432
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2120 place count 137 transition count 423
Iterating global reduction 8 with 9 rules applied. Total rules applied 2129 place count 137 transition count 423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2132 place count 137 transition count 420
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2150 place count 128 transition count 411
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 2160 place count 123 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2162 place count 123 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2164 place count 123 transition count 417
Free-agglomeration rule applied 38 times.
Iterating global reduction 10 with 38 rules applied. Total rules applied 2202 place count 123 transition count 379
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 41 rules applied. Total rules applied 2243 place count 85 transition count 376
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2247 place count 81 transition count 372
Iterating global reduction 11 with 4 rules applied. Total rules applied 2251 place count 81 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 124 transitions
Redundant transition composition rules discarded 124 transitions
Iterating global reduction 11 with 124 rules applied. Total rules applied 2375 place count 81 transition count 248
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2379 place count 79 transition count 258
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2381 place count 79 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2383 place count 77 transition count 256
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 2389 place count 77 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 2393 place count 77 transition count 252
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2394 place count 76 transition count 250
Iterating global reduction 12 with 1 rules applied. Total rules applied 2395 place count 76 transition count 250
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2396 place count 76 transition count 250
Applied a total of 2396 rules in 541 ms. Remains 76 /1249 variables (removed 1173) and now considering 250/2866 (removed 2616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 76/1249 places, 250/2866 transitions.
RANDOM walk for 22708 steps (783 resets) in 1036 ms. (21 steps per ms) remains 0/12 properties
FORMULA StigmergyCommit-PT-05b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 248 stabilizing places and 260 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||G(p2)))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Graph (trivial) has 1236 edges and 1249 vertex of which 99 / 1249 are part of one of the 17 SCC in 2 ms
Free SCC test removed 82 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 860 transitions
Trivial Post-agglo rules discarded 860 transitions
Performed 860 trivial Post agglomeration. Transition count delta: 860
Iterating post reduction 0 with 860 rules applied. Total rules applied 861 place count 1166 transition count 1912
Reduce places removed 860 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 881 rules applied. Total rules applied 1742 place count 306 transition count 1891
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1752 place count 298 transition count 1889
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1756 place count 296 transition count 1887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1757 place count 295 transition count 1887
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 63 Pre rules applied. Total rules applied 1757 place count 295 transition count 1824
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 1883 place count 232 transition count 1824
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1893 place count 222 transition count 1813
Iterating global reduction 5 with 10 rules applied. Total rules applied 1903 place count 222 transition count 1813
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1908 place count 217 transition count 1807
Iterating global reduction 5 with 5 rules applied. Total rules applied 1913 place count 217 transition count 1807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1914 place count 217 transition count 1806
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1918 place count 213 transition count 1801
Iterating global reduction 6 with 4 rules applied. Total rules applied 1922 place count 213 transition count 1801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1923 place count 213 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1925 place count 211 transition count 1798
Iterating global reduction 7 with 2 rules applied. Total rules applied 1927 place count 211 transition count 1798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1928 place count 211 transition count 1797
Performed 48 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 2024 place count 163 transition count 1748
Discarding 31 places :
Symmetric choice reduction at 8 with 31 rule applications. Total rules 2055 place count 132 transition count 457
Iterating global reduction 8 with 31 rules applied. Total rules applied 2086 place count 132 transition count 457
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2102 place count 132 transition count 441
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 2117 place count 117 transition count 422
Iterating global reduction 9 with 15 rules applied. Total rules applied 2132 place count 117 transition count 422
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 2147 place count 102 transition count 403
Iterating global reduction 9 with 15 rules applied. Total rules applied 2162 place count 102 transition count 403
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 2168 place count 102 transition count 397
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2188 place count 92 transition count 404
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2189 place count 91 transition count 391
Iterating global reduction 10 with 1 rules applied. Total rules applied 2190 place count 91 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2191 place count 91 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 2197 place count 91 transition count 384
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2198 place count 91 transition count 384
Applied a total of 2198 rules in 318 ms. Remains 91 /1249 variables (removed 1158) and now considering 384/2866 (removed 2482) transitions.
[2024-06-01 08:30:04] [INFO ] Flow matrix only has 377 transitions (discarded 7 similar events)
// Phase 1: matrix 377 rows 91 cols
[2024-06-01 08:30:04] [INFO ] Computed 2 invariants in 9 ms
[2024-06-01 08:30:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 08:30:04] [INFO ] Flow matrix only has 377 transitions (discarded 7 similar events)
[2024-06-01 08:30:04] [INFO ] Invariant cache hit.
[2024-06-01 08:30:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:30:05] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-01 08:30:05] [INFO ] Redundant transitions in 22 ms returned []
Running 367 sub problems to find dead transitions.
[2024-06-01 08:30:05] [INFO ] Flow matrix only has 377 transitions (discarded 7 similar events)
[2024-06-01 08:30:05] [INFO ] Invariant cache hit.
[2024-06-01 08:30:05] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 4 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 4 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 4 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 08:30:12] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:30:13] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 376/467 variables, 91/131 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 11 (OVERLAPS) 1/468 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 198 constraints, problems are : Problem set: 0 solved, 367 unsolved in 27654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 376/467 variables, 91/135 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 62/197 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 367/564 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 1/468 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 565 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 42/42 constraints]
After SMT, in 58377ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 58381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/1249 places, 384/2866 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59084 ms. Remains : 91/1249 places, 384/2866 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLCardinality-01
Product exploration explored 100000 steps with 9339 reset in 373 ms.
Product exploration explored 100000 steps with 9262 reset in 260 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (3709 resets) in 652 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (359 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (358 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (356 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (367 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 913043 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :1 out of 4
Probabilistic random walk after 913043 steps, saw 175258 distinct states, run finished after 3003 ms. (steps per millisecond=304 ) properties seen :1
[2024-06-01 08:31:07] [INFO ] Flow matrix only has 377 transitions (discarded 7 similar events)
[2024-06-01 08:31:07] [INFO ] Invariant cache hit.
[2024-06-01 08:31:07] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 375/464 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/467 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/468 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 375/464 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 62/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:31:08] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/467 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/468 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 384/384 transitions.
Graph (trivial) has 79 edges and 91 vertex of which 2 / 91 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 519 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 89 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 88 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 87 transition count 366
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 87 transition count 366
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 81 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 80 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 80 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 80 transition count 327
Free-agglomeration rule applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 60 place count 80 transition count 294
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 57 rules applied. Total rules applied 117 place count 46 transition count 271
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 123 place count 40 transition count 271
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 129 place count 34 transition count 265
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 34 transition count 265
Performed 12 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 159 place count 22 transition count 127
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 201 place count 22 transition count 85
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 203 place count 20 transition count 83
Iterating global reduction 6 with 2 rules applied. Total rules applied 205 place count 20 transition count 83
Performed 6 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 219 place count 12 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 230 place count 12 transition count 14
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 232 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 10 transition count 11
Applied a total of 234 rules in 52 ms. Remains 10 /91 variables (removed 81) and now considering 11/384 (removed 373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 10/91 places, 11/384 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
// Phase 1: matrix 11 rows 10 cols
[2024-06-01 08:31:09] [INFO ] Computed 3 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/21 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 13 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:31:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 10/21 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLCardinality-01 finished in 65200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(((p2 U p3)||p1)))))'
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Graph (trivial) has 1237 edges and 1249 vertex of which 97 / 1249 are part of one of the 17 SCC in 3 ms
Free SCC test removed 80 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 860 transitions
Trivial Post-agglo rules discarded 860 transitions
Performed 860 trivial Post agglomeration. Transition count delta: 860
Iterating post reduction 0 with 860 rules applied. Total rules applied 861 place count 1168 transition count 1914
Reduce places removed 860 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
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 1 with 883 rules applied. Total rules applied 1744 place count 308 transition count 1891
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 1755 place count 299 transition count 1889
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1757 place count 297 transition count 1889
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1757 place count 297 transition count 1827
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1881 place count 235 transition count 1827
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1892 place count 224 transition count 1815
Iterating global reduction 4 with 11 rules applied. Total rules applied 1903 place count 224 transition count 1815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1903 place count 224 transition count 1814
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1905 place count 223 transition count 1814
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1909 place count 219 transition count 1809
Iterating global reduction 4 with 4 rules applied. Total rules applied 1913 place count 219 transition count 1809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1914 place count 219 transition count 1808
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1917 place count 216 transition count 1804
Iterating global reduction 5 with 3 rules applied. Total rules applied 1920 place count 216 transition count 1804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1921 place count 216 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1922 place count 215 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 1923 place count 215 transition count 1802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1924 place count 215 transition count 1801
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 2018 place count 168 transition count 1754
Discarding 33 places :
Symmetric choice reduction at 7 with 33 rule applications. Total rules 2051 place count 135 transition count 399
Iterating global reduction 7 with 33 rules applied. Total rules applied 2084 place count 135 transition count 399
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 2102 place count 135 transition count 381
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2117 place count 120 transition count 362
Iterating global reduction 8 with 15 rules applied. Total rules applied 2132 place count 120 transition count 362
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2147 place count 105 transition count 343
Iterating global reduction 8 with 15 rules applied. Total rules applied 2162 place count 105 transition count 343
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2167 place count 105 transition count 338
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 2191 place count 93 transition count 344
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2192 place count 92 transition count 330
Iterating global reduction 9 with 1 rules applied. Total rules applied 2193 place count 92 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2194 place count 92 transition count 329
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 2200 place count 92 transition count 323
Applied a total of 2200 rules in 246 ms. Remains 92 /1249 variables (removed 1157) and now considering 323/2866 (removed 2543) transitions.
[2024-06-01 08:31:09] [INFO ] Flow matrix only has 316 transitions (discarded 7 similar events)
// Phase 1: matrix 316 rows 92 cols
[2024-06-01 08:31:09] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 08:31:09] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 08:31:09] [INFO ] Flow matrix only has 316 transitions (discarded 7 similar events)
[2024-06-01 08:31:09] [INFO ] Invariant cache hit.
[2024-06-01 08:31:09] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:31:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-01 08:31:10] [INFO ] Redundant transitions in 6 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-01 08:31:10] [INFO ] Flow matrix only has 316 transitions (discarded 7 similar events)
[2024-06-01 08:31:10] [INFO ] Invariant cache hit.
[2024-06-01 08:31:10] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:31:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2024-06-01 08:31:12] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:31:13] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:31:14] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:31:15] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:31:15] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-06-01 08:31:15] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:31:15] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 315/407 variables, 92/121 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 62/183 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:19] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:20] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 11 (OVERLAPS) 1/408 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 186 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 315/407 variables, 92/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 62/185 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 306/491 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:40] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:31:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-01 08:32:00] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:32:00] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/408 variables, and 495 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 33/33 constraints]
After SMT, in 52310ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 52313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/1249 places, 323/2866 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52852 ms. Remains : 92/1249 places, 323/2866 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLCardinality-03
Product exploration explored 100000 steps with 9218 reset in 172 ms.
Product exploration explored 100000 steps with 9294 reset in 169 ms.
Computed a total of 8 stabilizing places and 26 stable transitions
Computed a total of 8 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p1 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (3725 resets) in 159 ms. (250 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (348 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (346 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (354 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (348 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2024-06-01 08:32:03] [INFO ] Flow matrix only has 316 transitions (discarded 7 similar events)
[2024-06-01 08:32:03] [INFO ] Invariant cache hit.
[2024-06-01 08:32:03] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 314/404 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 62/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/407 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/408 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 157 constraints, problems are : Problem set: 0 solved, 4 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 4 (OVERLAPS) 314/404 variables, 90/101 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 62/163 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/165 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/407 variables, 2/167 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/408 variables, 1/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 169 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1215ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 1 properties in 28 ms.
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 323/323 transitions.
Graph (complete) has 485 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 20 rules applied. Total rules applied 21 place count 91 transition count 302
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 30 place count 84 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 83 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 83 transition count 299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 77 transition count 293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 76 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 76 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 75 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 75 transition count 291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 74 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 74 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 74 transition count 289
Free-agglomeration rule applied 31 times.
Iterating global reduction 3 with 31 rules applied. Total rules applied 82 place count 74 transition count 258
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 71 rules applied. Total rules applied 153 place count 42 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 159 place count 36 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 165 place count 30 transition count 213
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 30 transition count 213
Performed 12 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 195 place count 18 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 224 place count 18 transition count 78
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 226 place count 16 transition count 76
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 16 transition count 76
Performed 7 Post agglomeration using F-continuation condition with reduction of 57 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 246 place count 5 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 253 place count 5 transition count 5
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 254 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 255 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 257 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 258 place count 2 transition count 2
Applied a total of 258 rules in 44 ms. Remains 2 /92 variables (removed 90) and now considering 2/323 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 2/92 places, 2/323 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (G (OR p3 p1)), (G (OR p0 p3 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p3))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLCardinality-03 finished in 54893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U G((F(p1)||X(p2))))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1232 transition count 2849
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1232 transition count 2849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1232 transition count 2848
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 1223 transition count 2839
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 1223 transition count 2839
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 1218 transition count 2834
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 1218 transition count 2834
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 1213 transition count 2829
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 1213 transition count 2829
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 1209 transition count 2825
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 1209 transition count 2825
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 1209 transition count 2824
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 1206 transition count 2821
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 1206 transition count 2821
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 1203 transition count 2818
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 1203 transition count 2818
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 1200 transition count 2815
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 1200 transition count 2815
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 1197 transition count 2812
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 1197 transition count 2812
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 1194 transition count 2809
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 1194 transition count 2809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 1194 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1192 transition count 2806
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1192 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1190 transition count 2804
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1190 transition count 2804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 1190 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 1189 transition count 2802
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 1189 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 1188 transition count 2801
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 1188 transition count 2801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 1188 transition count 2800
Applied a total of 127 rules in 830 ms. Remains 1188 /1249 variables (removed 61) and now considering 2800/2866 (removed 66) transitions.
// Phase 1: matrix 2800 rows 1188 cols
[2024-06-01 08:32:05] [INFO ] Computed 7 invariants in 30 ms
[2024-06-01 08:32:05] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-06-01 08:32:05] [INFO ] Invariant cache hit.
[2024-06-01 08:32:07] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
Running 2799 sub problems to find dead transitions.
[2024-06-01 08:32:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 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 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 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 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)timeout

(s207 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1187/3988 variables, and 0 constraints, problems are : Problem set: 0 solved, 2799 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1188 constraints, PredecessorRefiner: 2799/2799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2799 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1187/3988 variables, and 0 constraints, problems are : Problem set: 0 solved, 2799 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1188 constraints, PredecessorRefiner: 0/2799 constraints, Known Traps: 0/0 constraints]
After SMT, in 82061ms problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 82092ms
Starting structural reductions in LTL mode, iteration 1 : 1188/1249 places, 2800/2866 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84960 ms. Remains : 1188/1249 places, 2800/2866 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLCardinality-06
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLCardinality-06 finished in 85390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(!p0) U ((p1&&X(!p0))||X(G(!p0))))))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1231 transition count 2848
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1231 transition count 2848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1231 transition count 2847
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 1221 transition count 2837
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 1221 transition count 2837
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 1215 transition count 2831
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 1215 transition count 2831
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 1209 transition count 2825
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 1209 transition count 2825
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 1204 transition count 2820
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 1204 transition count 2820
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 1204 transition count 2819
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 1200 transition count 2815
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 1200 transition count 2815
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 1196 transition count 2811
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 1196 transition count 2811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 1192 transition count 2807
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 1192 transition count 2807
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 1188 transition count 2803
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 1188 transition count 2803
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 1184 transition count 2799
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 1184 transition count 2799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 1184 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 1182 transition count 2795
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 1182 transition count 2795
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 1180 transition count 2793
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 1180 transition count 2793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 1179 transition count 2791
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 1178 transition count 2790
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 1178 transition count 2789
Applied a total of 148 rules in 738 ms. Remains 1178 /1249 variables (removed 71) and now considering 2789/2866 (removed 77) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:33:30] [INFO ] Computed 7 invariants in 29 ms
[2024-06-01 08:33:31] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-01 08:33:31] [INFO ] Invariant cache hit.
[2024-06-01 08:33:32] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:33:32] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 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 1)
(s52 1)
(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 1)
(s79 1)
(s80 1)
(s81 1)
(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 1)
(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 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 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 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 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 1)
(s201 1)
(s202 1)
(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 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 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 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 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 1)
(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 1)
(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 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(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 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(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 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 1)
(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 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(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 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(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 1)
(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 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(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 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(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 1)
(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 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(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 1)
(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 1)
(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 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(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)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 80198ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 80239ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1249 places, 2789/2866 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82891 ms. Remains : 1178/1249 places, 2789/2866 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, p0, false, false, p0]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLCardinality-08
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLCardinality-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLCardinality-08 finished in 83094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(p0) U X(((X(F(X(p2)))||p1)&&!p3)))))'
Support contains 7 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2866/2866 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1234 transition count 2851
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1234 transition count 2851
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1234 transition count 2850
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 1227 transition count 2843
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 1227 transition count 2843
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1223 transition count 2839
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1223 transition count 2839
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 1219 transition count 2835
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 1219 transition count 2835
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1216 transition count 2832
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1216 transition count 2832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1216 transition count 2831
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1214 transition count 2829
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1214 transition count 2829
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1212 transition count 2827
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1212 transition count 2827
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1210 transition count 2825
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1210 transition count 2825
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 1208 transition count 2823
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1208 transition count 2823
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 1206 transition count 2821
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 1206 transition count 2821
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1206 transition count 2820
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 1205 transition count 2819
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 1205 transition count 2819
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 1204 transition count 2818
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 1204 transition count 2818
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 1203 transition count 2817
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 1203 transition count 2817
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 1202 transition count 2816
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 1202 transition count 2816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 1202 transition count 2815
Applied a total of 98 rules in 743 ms. Remains 1202 /1249 variables (removed 47) and now considering 2815/2866 (removed 51) transitions.
// Phase 1: matrix 2815 rows 1202 cols
[2024-06-01 08:34:53] [INFO ] Computed 7 invariants in 29 ms
[2024-06-01 08:34:54] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-06-01 08:34:54] [INFO ] Invariant cache hit.
[2024-06-01 08:34:55] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
Running 2814 sub problems to find dead transitions.
[2024-06-01 08:34:55] [INFO ] Invariant cache hit.
FORMULA StigmergyCommit-PT-05b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-01
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-02
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-03
FORMULA StigmergyCommit-PT-05b-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-07
FORMULA StigmergyCommit-PT-05b-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-09
FORMULA StigmergyCommit-PT-05b-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyCommit-PT-05b-LTLCardinality-13
FORMULA StigmergyCommit-PT-05b-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-05b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717232260730

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-00
ltl formula formula --ltl=/tmp/1053/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.140 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3461 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~93!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 376
pnml2lts-mc( 0/ 4): unique transitions count: 1752
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 384
pnml2lts-mc( 0/ 4): - cum. max stack depth: 384
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 384 states 1771 transitions, fanout: 4.612
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4267, Transitions per second: 19678
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-01
ltl formula formula --ltl=/tmp/1053/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.110 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3466 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~147 levels ~10000 states ~26616 transitions
pnml2lts-mc( 3/ 4): ~117 levels ~20000 states ~89044 transitions
pnml2lts-mc( 3/ 4): ~117 levels ~40000 states ~180828 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~80000 states ~359940 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~160000 states ~737948 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~320000 states ~1478316 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~640000 states ~2957828 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-02
ltl formula formula --ltl=/tmp/1053/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.140 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3468 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~142 levels ~10000 states ~22728 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~20000 states ~52204 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~40000 states ~120972 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~80000 states ~263740 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~160000 states ~556212 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~320000 states ~1255152 transitions
pnml2lts-mc( 3/ 4): ~142 levels ~640000 states ~2700564 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-03
ltl formula formula --ltl=/tmp/1053/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.130 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3463 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~128 levels ~10000 states ~26460 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~20000 states ~53836 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~40000 states ~107276 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~80000 states ~211168 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~160000 states ~434176 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~320000 states ~988308 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~640000 states ~2185452 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-04
ltl formula formula --ltl=/tmp/1053/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.120 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3484 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~110!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 411
pnml2lts-mc( 0/ 4): unique transitions count: 3204
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 420
pnml2lts-mc( 0/ 4): - cum. max stack depth: 420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 420 states 3246 transitions, fanout: 7.729
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4667, Transitions per second: 36067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 18.8 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-05
ltl formula formula --ltl=/tmp/1053/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.130 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3467 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6 states 8 transitions, fanout: 1.333
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 108.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-06
ltl formula formula --ltl=/tmp/1053/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.120 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3503 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~92!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 325
pnml2lts-mc( 0/ 4): unique transitions count: 1655
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 332
pnml2lts-mc( 0/ 4): - cum. max stack depth: 332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 332 states 1677 transitions, fanout: 5.051
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4743, Transitions per second: 23957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.9 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-07
ltl formula formula --ltl=/tmp/1053/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3470 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~129 levels ~10000 states ~33684 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~20000 states ~52356 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~40000 states ~105376 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~80000 states ~217388 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~160000 states ~434256 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~320000 states ~875552 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~640000 states ~1763508 transitions
pnml2lts-mc( 2/ 4): ~146 levels ~1280000 states ~3623024 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-08
ltl formula formula --ltl=/tmp/1053/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.120 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3468 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-09
ltl formula formula --ltl=/tmp/1053/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.130 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3481 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~115 levels ~10000 states ~26560 transitions
pnml2lts-mc( 0/ 4): ~115 levels ~20000 states ~52032 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~40000 states ~104352 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~80000 states ~212432 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~160000 states ~434100 transitions
pnml2lts-mc( 0/ 4): ~135 levels ~320000 states ~858384 transitions
pnml2lts-mc( 1/ 4): ~147 levels ~640000 states ~2121412 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-10
ltl formula formula --ltl=/tmp/1053/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.090 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1838 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3464 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~93!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 380
pnml2lts-mc( 0/ 4): unique transitions count: 1771
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 390
pnml2lts-mc( 0/ 4): - cum. max stack depth: 390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 390 states 1793 transitions, fanout: 4.597
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4333, Transitions per second: 19922
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-11
ltl formula formula --ltl=/tmp/1053/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.120 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3464 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6 states 8 transitions, fanout: 1.333
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 112.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-12
ltl formula formula --ltl=/tmp/1053/ltl_12_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.130 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3462 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7 states 8 transitions, fanout: 1.143
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 108.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-13
ltl formula formula --ltl=/tmp/1053/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.110 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3469 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~136 levels ~10000 states ~24108 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~20000 states ~54296 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~40000 states ~78264 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~80000 states ~187344 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~160000 states ~427540 transitions
pnml2lts-mc( 2/ 4): ~164 levels ~320000 states ~581796 transitions
pnml2lts-mc( 3/ 4): ~154 levels ~640000 states ~2101296 transitions
pnml2lts-mc( 3/ 4): ~154 levels ~1280000 states ~4263600 transitions
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-14
ltl formula formula --ltl=/tmp/1053/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.100 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3463 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 16 transitions, fanout: 1.333
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 1600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 108.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-05b-LTLCardinality-15
ltl formula formula --ltl=/tmp/1053/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1837 places, 3460 transitions and 22362 arcs
pnml2lts-mc( 0/ 4): Petri net StigmergyCommit-PT-05b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.120 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1053/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1053/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1053/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1053/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1839 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1838, there are 3465 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~99 levels ~10000 states ~17212 transitions
pnml2lts-mc( 3/ 4): ~117 levels ~20000 states ~33588 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~111!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33016
pnml2lts-mc( 0/ 4): unique states count: 33430
pnml2lts-mc( 0/ 4): unique transitions count: 52878
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 18291
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33439
pnml2lts-mc( 0/ 4): - cum. max stack depth: 522
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33439 states 52902 transitions, fanout: 1.582
pnml2lts-mc( 0/ 4): Total exploration time 5.790 sec (5.790 sec minimum, 5.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5775, Transitions per second: 9137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 13.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3517 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-05b, 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 r536-tall-171690531700147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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