Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r457-smll-167912649300420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is StigmergyCommit-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 359K Mar 5 18:23 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-03b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679436056639

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:00:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:00:59] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-21 22:00:59] [INFO ] Transformed 1231 places.
[2023-03-21 22:00:59] [INFO ] Transformed 1476 transitions.
[2023-03-21 22:00:59] [INFO ] Found NUPN structural information;
[2023-03-21 22:00:59] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1134 transition count 1379
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1134 transition count 1379
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 253 place count 1075 transition count 1320
Iterating global reduction 0 with 59 rules applied. Total rules applied 312 place count 1075 transition count 1320
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 346 place count 1041 transition count 1286
Iterating global reduction 0 with 34 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 408 place count 1013 transition count 1258
Iterating global reduction 0 with 28 rules applied. Total rules applied 436 place count 1013 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 460 place count 989 transition count 1234
Iterating global reduction 0 with 24 rules applied. Total rules applied 484 place count 989 transition count 1234
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 508 place count 965 transition count 1210
Iterating global reduction 0 with 24 rules applied. Total rules applied 532 place count 965 transition count 1210
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 556 place count 941 transition count 1186
Iterating global reduction 0 with 24 rules applied. Total rules applied 580 place count 941 transition count 1186
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 604 place count 917 transition count 1162
Iterating global reduction 0 with 24 rules applied. Total rules applied 628 place count 917 transition count 1162
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 649 place count 896 transition count 1141
Iterating global reduction 0 with 21 rules applied. Total rules applied 670 place count 896 transition count 1141
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 687 place count 879 transition count 1124
Iterating global reduction 0 with 17 rules applied. Total rules applied 704 place count 879 transition count 1124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 707 place count 879 transition count 1121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 713 place count 873 transition count 1115
Iterating global reduction 1 with 6 rules applied. Total rules applied 719 place count 873 transition count 1115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 725 place count 867 transition count 1109
Iterating global reduction 1 with 6 rules applied. Total rules applied 731 place count 867 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 735 place count 863 transition count 1105
Iterating global reduction 1 with 4 rules applied. Total rules applied 739 place count 863 transition count 1105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 743 place count 859 transition count 1101
Iterating global reduction 1 with 4 rules applied. Total rules applied 747 place count 859 transition count 1101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 751 place count 855 transition count 1097
Iterating global reduction 1 with 4 rules applied. Total rules applied 755 place count 855 transition count 1097
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 759 place count 851 transition count 1093
Iterating global reduction 1 with 4 rules applied. Total rules applied 763 place count 851 transition count 1093
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 767 place count 847 transition count 1089
Iterating global reduction 1 with 4 rules applied. Total rules applied 771 place count 847 transition count 1089
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 775 place count 843 transition count 1085
Iterating global reduction 1 with 4 rules applied. Total rules applied 779 place count 843 transition count 1085
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 783 place count 839 transition count 1081
Iterating global reduction 1 with 4 rules applied. Total rules applied 787 place count 839 transition count 1081
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 791 place count 835 transition count 1077
Iterating global reduction 1 with 4 rules applied. Total rules applied 795 place count 835 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 798 place count 832 transition count 1074
Iterating global reduction 1 with 3 rules applied. Total rules applied 801 place count 832 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 804 place count 829 transition count 1071
Iterating global reduction 1 with 3 rules applied. Total rules applied 807 place count 829 transition count 1071
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 810 place count 829 transition count 1068
Applied a total of 810 rules in 1483 ms. Remains 829 /1231 variables (removed 402) and now considering 1068/1476 (removed 408) transitions.
// Phase 1: matrix 1068 rows 829 cols
[2023-03-21 22:01:01] [INFO ] Computed 5 place invariants in 50 ms
[2023-03-21 22:01:01] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-21 22:01:01] [INFO ] Invariant cache hit.
[2023-03-21 22:01:02] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2023-03-21 22:01:02] [INFO ] Invariant cache hit.
[2023-03-21 22:01:03] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 829/1231 places, 1068/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4219 ms. Remains : 829/1231 places, 1068/1476 transitions.
Support contains 35 out of 829 places after structural reductions.
[2023-03-21 22:01:04] [INFO ] Flatten gal took : 172 ms
[2023-03-21 22:01:04] [INFO ] Flatten gal took : 86 ms
[2023-03-21 22:01:04] [INFO ] Input system was already deterministic with 1068 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-21 22:01:05] [INFO ] Invariant cache hit.
[2023-03-21 22:01:06] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-21 22:01:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-21 22:01:08] [INFO ] After 1409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-21 22:01:09] [INFO ] Deduced a trap composed of 299 places in 319 ms of which 7 ms to minimize.
[2023-03-21 22:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-21 22:01:10] [INFO ] After 3408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 897 ms.
[2023-03-21 22:01:11] [INFO ] After 5124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 11 properties in 221 ms.
Support contains 7 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 814 edges and 829 vertex of which 59 / 829 are part of one of the 10 SCC in 7 ms
Free SCC test removed 49 places
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1233 edges and 780 vertex of which 777 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 577 transitions
Trivial Post-agglo rules discarded 577 transitions
Performed 577 trivial Post agglomeration. Transition count delta: 577
Iterating post reduction 0 with 580 rules applied. Total rules applied 582 place count 777 transition count 422
Reduce places removed 577 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 592 rules applied. Total rules applied 1174 place count 200 transition count 407
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1182 place count 194 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1184 place count 192 transition count 405
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1184 place count 192 transition count 358
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1278 place count 145 transition count 358
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1280 place count 143 transition count 356
Iterating global reduction 4 with 2 rules applied. Total rules applied 1282 place count 143 transition count 356
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1342 place count 113 transition count 326
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1350 place count 113 transition count 318
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1373 place count 90 transition count 166
Iterating global reduction 5 with 23 rules applied. Total rules applied 1396 place count 90 transition count 166
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1408 place count 90 transition count 154
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1419 place count 79 transition count 143
Iterating global reduction 6 with 11 rules applied. Total rules applied 1430 place count 79 transition count 143
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1438 place count 71 transition count 135
Iterating global reduction 6 with 8 rules applied. Total rules applied 1446 place count 71 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1450 place count 71 transition count 131
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1460 place count 66 transition count 126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1466 place count 63 transition count 134
Free-agglomeration rule applied 25 times.
Iterating global reduction 7 with 25 rules applied. Total rules applied 1491 place count 63 transition count 109
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 1525 place count 38 transition count 100
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1529 place count 34 transition count 96
Iterating global reduction 8 with 4 rules applied. Total rules applied 1533 place count 34 transition count 96
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1551 place count 34 transition count 78
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 1553 place count 33 transition count 77
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1557 place count 33 transition count 77
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1559 place count 33 transition count 75
Applied a total of 1559 rules in 153 ms. Remains 33 /829 variables (removed 796) and now considering 75/1068 (removed 993) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 33/829 places, 75/1068 transitions.
Finished random walk after 131 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=21 )
Computed a total of 171 stabilizing places and 179 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1)||G(p2)))))'
Support contains 3 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 822 transition count 1061
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 822 transition count 1061
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 817 transition count 1056
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 817 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 813 transition count 1052
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 813 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 809 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 809 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 805 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 805 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 801 transition count 1040
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 801 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 798 transition count 1037
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 797 transition count 1035
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 797 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 796 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 795 transition count 1033
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 793 transition count 1031
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 793 transition count 1031
Applied a total of 73 rules in 752 ms. Remains 793 /829 variables (removed 36) and now considering 1031/1068 (removed 37) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2023-03-21 22:01:13] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-21 22:01:13] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-21 22:01:13] [INFO ] Invariant cache hit.
[2023-03-21 22:01:14] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-03-21 22:01:14] [INFO ] Invariant cache hit.
[2023-03-21 22:01:15] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 793/829 places, 1031/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2906 ms. Remains : 793/829 places, 1031/1068 transitions.
Stuttering acceptance computed with spot in 471 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s118 1), p1:(EQ s538 0), p0:(EQ s786 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 3469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p0)) U X(G((F(p2)&&p1)))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 815 transition count 1054
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 815 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 811 transition count 1050
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 811 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 807 transition count 1046
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 807 transition count 1046
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 803 transition count 1042
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 803 transition count 1042
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 799 transition count 1038
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 799 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 796 transition count 1035
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 796 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 795 transition count 1033
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 794 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 793 transition count 1031
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 792 transition count 1030
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 791 transition count 1029
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 791 transition count 1029
Applied a total of 77 rules in 315 ms. Remains 791 /829 variables (removed 38) and now considering 1029/1068 (removed 39) transitions.
// Phase 1: matrix 1029 rows 791 cols
[2023-03-21 22:01:16] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 22:01:16] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-21 22:01:16] [INFO ] Invariant cache hit.
[2023-03-21 22:01:17] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-03-21 22:01:17] [INFO ] Invariant cache hit.
[2023-03-21 22:01:18] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 791/829 places, 1029/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2449 ms. Remains : 791/829 places, 1029/1068 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s230 1), p1:(AND (EQ s77 1) (EQ s291 1) (EQ s505 1) (EQ s678 1)), p2:(EQ s540 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-01 finished in 2675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 814 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 814 transition count 1053
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 814 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 810 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 806 transition count 1044
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 806 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 802 transition count 1040
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 798 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 795 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 795 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 791 transition count 1028
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 790 transition count 1027
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 790 transition count 1027
Applied a total of 80 rules in 359 ms. Remains 790 /829 variables (removed 39) and now considering 1027/1068 (removed 41) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2023-03-21 22:01:18] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 22:01:19] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-21 22:01:19] [INFO ] Invariant cache hit.
[2023-03-21 22:01:19] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2023-03-21 22:01:19] [INFO ] Invariant cache hit.
[2023-03-21 22:01:20] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/829 places, 1027/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2569 ms. Remains : 790/829 places, 1027/1068 transitions.
Stuttering acceptance computed with spot in 439 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1)), p3:(NEQ s661 1), p2:(NEQ s401 1), p1:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1288 reset in 365 ms.
Product exploration explored 100000 steps with 1279 reset in 303 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-21 22:01:23] [INFO ] Invariant cache hit.
[2023-03-21 22:01:23] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-21 22:01:24] [INFO ] After 609ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2023-03-21 22:01:24] [INFO ] After 878ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-21 22:01:24] [INFO ] After 1345ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3 real:2
[2023-03-21 22:01:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-21 22:01:25] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-21 22:01:26] [INFO ] After 1112ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-21 22:01:26] [INFO ] After 1625ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 23 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 85 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 24/790 places, 80/1027 transitions.
Finished random walk after 164 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=41 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 p1), true, (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p3 p2))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND p3 (NOT p2))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 326 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 506 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 24 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2023-03-21 22:01:27] [INFO ] Invariant cache hit.
[2023-03-21 22:01:28] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-21 22:01:28] [INFO ] Invariant cache hit.
[2023-03-21 22:01:28] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
[2023-03-21 22:01:28] [INFO ] Invariant cache hit.
[2023-03-21 22:01:29] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2102 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:01:30] [INFO ] Invariant cache hit.
[2023-03-21 22:01:31] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-21 22:01:31] [INFO ] After 554ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-21 22:01:31] [INFO ] After 724ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-21 22:01:32] [INFO ] After 1090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-21 22:01:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-21 22:01:32] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:01:33] [INFO ] After 1012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-21 22:01:33] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 19 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 63 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 24/790 places, 80/1027 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p3 p2))), (F (NOT p1)), (F (NOT p0)), (F (AND p3 (NOT p2))), (F (NOT p3))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 380 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 380 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1292 reset in 151 ms.
Product exploration explored 100000 steps with 1289 reset in 168 ms.
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 21 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2023-03-21 22:01:35] [INFO ] Invariant cache hit.
[2023-03-21 22:01:35] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-21 22:01:35] [INFO ] Invariant cache hit.
[2023-03-21 22:01:36] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-21 22:01:36] [INFO ] Invariant cache hit.
[2023-03-21 22:01:37] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2183 ms. Remains : 790/790 places, 1027/1027 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 19447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 821 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 1172 place count 193 transition count 409
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1178 place count 187 transition count 409
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1178 place count 187 transition count 371
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1261 place count 142 transition count 364
Iterating global reduction 4 with 7 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1268 place count 142 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1270 place count 141 transition count 363
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1330 place count 111 transition count 332
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1355 place count 86 transition count 181
Iterating global reduction 4 with 25 rules applied. Total rules applied 1380 place count 86 transition count 181
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1392 place count 86 transition count 169
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1404 place count 74 transition count 153
Iterating global reduction 5 with 12 rules applied. Total rules applied 1416 place count 74 transition count 153
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1428 place count 62 transition count 137
Iterating global reduction 5 with 12 rules applied. Total rules applied 1440 place count 62 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1444 place count 62 transition count 133
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1460 place count 54 transition count 140
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1461 place count 53 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 53 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1463 place count 53 transition count 131
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1467 place count 53 transition count 127
Applied a total of 1467 rules in 82 ms. Remains 53 /829 variables (removed 776) and now considering 127/1068 (removed 941) transitions.
[2023-03-21 22:01:37] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
// Phase 1: matrix 123 rows 53 cols
[2023-03-21 22:01:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:01:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-21 22:01:38] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-21 22:01:38] [INFO ] Invariant cache hit.
[2023-03-21 22:01:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:01:38] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-21 22:01:38] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:01:38] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2023-03-21 22:01:38] [INFO ] Invariant cache hit.
[2023-03-21 22:01:38] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/829 places, 127/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 53/829 places, 127/1068 transitions.
Stuttering acceptance computed with spot in 40 ms :[false]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s26 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3275 reset in 271 ms.
Stack based approach found an accepted trace after 1802 steps with 246 reset with depth 3 and stack size 3 in 8 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 820 transition count 1059
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 820 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 814 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 814 transition count 1053
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 814 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 810 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 806 transition count 1044
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 806 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 802 transition count 1040
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 798 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 795 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 795 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 791 transition count 1028
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 790 transition count 1027
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 790 transition count 1027
Applied a total of 80 rules in 708 ms. Remains 790 /829 variables (removed 39) and now considering 1027/1068 (removed 41) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2023-03-21 22:01:39] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-21 22:01:39] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-21 22:01:39] [INFO ] Invariant cache hit.
[2023-03-21 22:01:40] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-21 22:01:40] [INFO ] Invariant cache hit.
[2023-03-21 22:01:41] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/829 places, 1027/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2504 ms. Remains : 790/829 places, 1027/1068 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s256 1) (EQ s407 1) (EQ s621 1)), p1:(AND (OR (EQ s42 0) (EQ s256 0) (EQ s407 0) (EQ s621 0)) (EQ s540 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 1 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-04 finished in 2653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 827 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 771 transition count 426
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 591 rules applied. Total rules applied 1168 place count 195 transition count 411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1174 place count 189 transition count 411
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1174 place count 189 transition count 371
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1260 place count 143 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 1266 place count 143 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1266 place count 143 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1328 place count 112 transition count 333
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1352 place count 88 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 1376 place count 88 transition count 183
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1388 place count 88 transition count 171
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1399 place count 77 transition count 156
Iterating global reduction 4 with 11 rules applied. Total rules applied 1410 place count 77 transition count 156
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1421 place count 66 transition count 141
Iterating global reduction 4 with 11 rules applied. Total rules applied 1432 place count 66 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1435 place count 66 transition count 138
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1451 place count 58 transition count 152
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1452 place count 57 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 1453 place count 57 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1454 place count 57 transition count 143
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1458 place count 57 transition count 139
Applied a total of 1458 rules in 50 ms. Remains 57 /829 variables (removed 772) and now considering 139/1068 (removed 929) transitions.
[2023-03-21 22:01:41] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 57 cols
[2023-03-21 22:01:41] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-21 22:01:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-21 22:01:41] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2023-03-21 22:01:41] [INFO ] Invariant cache hit.
[2023-03-21 22:01:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:01:41] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-21 22:01:41] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:01:41] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2023-03-21 22:01:41] [INFO ] Invariant cache hit.
[2023-03-21 22:01:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/829 places, 139/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 57/829 places, 139/1068 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-05 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U p1) U p2))))'
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 822 transition count 1061
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 822 transition count 1061
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 816 transition count 1055
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 812 transition count 1050
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 812 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 808 transition count 1046
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 808 transition count 1046
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 804 transition count 1042
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 800 transition count 1038
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 800 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 797 transition count 1035
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 797 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 797 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 796 transition count 1033
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 796 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 795 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 795 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 794 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 794 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 793 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 793 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 792 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 792 transition count 1029
Applied a total of 76 rules in 318 ms. Remains 792 /829 variables (removed 37) and now considering 1029/1068 (removed 39) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2023-03-21 22:01:42] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-21 22:01:42] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-21 22:01:42] [INFO ] Invariant cache hit.
[2023-03-21 22:01:43] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-21 22:01:43] [INFO ] Invariant cache hit.
[2023-03-21 22:01:43] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 792/829 places, 1029/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2267 ms. Remains : 792/829 places, 1029/1068 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s10 1) (AND (EQ s157 1) (EQ s351 1) (EQ s543 1) (EQ s737 1))), p1:(AND (EQ s157 1) (EQ s351 1) (EQ s543 1) (EQ s737 1)), p0:(EQ s702 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 2529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 816 transition count 1055
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 813 transition count 1051
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 813 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 810 transition count 1048
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 807 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 807 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 804 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 802 transition count 1040
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 802 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 801 transition count 1039
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 801 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 800 transition count 1038
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 799 transition count 1037
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 799 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 798 transition count 1036
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 797 transition count 1035
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 797 transition count 1035
Applied a total of 65 rules in 324 ms. Remains 797 /829 variables (removed 32) and now considering 1035/1068 (removed 33) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2023-03-21 22:01:44] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-21 22:01:44] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-21 22:01:44] [INFO ] Invariant cache hit.
[2023-03-21 22:01:45] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-21 22:01:45] [INFO ] Invariant cache hit.
[2023-03-21 22:01:46] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/829 places, 1035/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 797/829 places, 1035/1068 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s347 0), p0:(AND (EQ s63 1) (EQ s235 1) (EQ s435 1) (EQ s628 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1291 reset in 169 ms.
Product exploration explored 100000 steps with 1283 reset in 211 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 356208 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356208 steps, saw 72052 distinct states, run finished after 3003 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:01:50] [INFO ] Invariant cache hit.
[2023-03-21 22:01:50] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:01:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-21 22:01:51] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:01:52] [INFO ] Deduced a trap composed of 302 places in 484 ms of which 1 ms to minimize.
[2023-03-21 22:01:52] [INFO ] Deduced a trap composed of 299 places in 453 ms of which 2 ms to minimize.
[2023-03-21 22:01:53] [INFO ] Deduced a trap composed of 299 places in 368 ms of which 1 ms to minimize.
[2023-03-21 22:01:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1488 ms
[2023-03-21 22:01:53] [INFO ] After 2222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-21 22:01:53] [INFO ] After 2513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 62 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 31 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2023-03-21 22:01:53] [INFO ] Invariant cache hit.
[2023-03-21 22:01:54] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-21 22:01:54] [INFO ] Invariant cache hit.
[2023-03-21 22:01:55] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-03-21 22:01:55] [INFO ] Invariant cache hit.
[2023-03-21 22:01:56] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 797/797 places, 1035/1035 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 462545 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462545 steps, saw 90847 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:01:59] [INFO ] Invariant cache hit.
[2023-03-21 22:02:00] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:02:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-21 22:02:00] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:02:01] [INFO ] Deduced a trap composed of 302 places in 499 ms of which 1 ms to minimize.
[2023-03-21 22:02:01] [INFO ] Deduced a trap composed of 299 places in 410 ms of which 1 ms to minimize.
[2023-03-21 22:02:02] [INFO ] Deduced a trap composed of 299 places in 346 ms of which 1 ms to minimize.
[2023-03-21 22:02:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1432 ms
[2023-03-21 22:02:02] [INFO ] After 2129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-21 22:02:02] [INFO ] After 2404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 58 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1288 reset in 178 ms.
Product exploration explored 100000 steps with 1276 reset in 192 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 547 place count 741 transition count 971
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 555 place count 741 transition count 963
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 555 place count 741 transition count 967
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 587 place count 741 transition count 967
Discarding 490 places :
Symmetric choice reduction at 2 with 490 rule applications. Total rules 1077 place count 251 transition count 477
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 490 rules applied. Total rules applied 1567 place count 251 transition count 477
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1612 place count 251 transition count 490
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1682 place count 181 transition count 348
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1752 place count 181 transition count 348
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1765 place count 181 transition count 335
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1794 place count 152 transition count 302
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1823 place count 152 transition count 302
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1835 place count 140 transition count 290
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1847 place count 140 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1851 place count 140 transition count 286
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1859 place count 132 transition count 278
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1867 place count 132 transition count 278
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1874 place count 132 transition count 313
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1885 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1896 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1904 place count 121 transition count 283
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 1904 rules in 105 ms. Remains 121 /797 variables (removed 676) and now considering 283/1035 (removed 752) transitions.
[2023-03-21 22:02:03] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-21 22:02:03] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
// Phase 1: matrix 278 rows 121 cols
[2023-03-21 22:02:03] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-21 22:02:03] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/797 places, 283/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 121/797 places, 283/1035 transitions.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 53 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2023-03-21 22:02:04] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 22:02:04] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-21 22:02:04] [INFO ] Invariant cache hit.
[2023-03-21 22:02:04] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2023-03-21 22:02:04] [INFO ] Invariant cache hit.
[2023-03-21 22:02:05] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1999 ms. Remains : 797/797 places, 1035/1035 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 21851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 821 transition count 1060
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 1060
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 816 transition count 1055
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 816 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 816 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 813 transition count 1051
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 813 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 810 transition count 1048
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 810 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 807 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 807 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 804 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 804 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 802 transition count 1040
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 802 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 802 transition count 1039
Applied a total of 56 rules in 220 ms. Remains 802 /829 variables (removed 27) and now considering 1039/1068 (removed 29) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2023-03-21 22:02:06] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-21 22:02:06] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-21 22:02:06] [INFO ] Invariant cache hit.
[2023-03-21 22:02:07] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2023-03-21 22:02:07] [INFO ] Invariant cache hit.
[2023-03-21 22:02:08] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/829 places, 1039/1068 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2297 ms. Remains : 802/829 places, 1039/1068 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s139 0), p2:(NEQ s139 1), p1:(EQ s655 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1277 reset in 310 ms.
Product exploration explored 100000 steps with 1279 reset in 253 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:02:09] [INFO ] Invariant cache hit.
[2023-03-21 22:02:10] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-21 22:02:10] [INFO ] After 494ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-21 22:02:11] [INFO ] Deduced a trap composed of 299 places in 378 ms of which 4 ms to minimize.
[2023-03-21 22:02:11] [INFO ] Deduced a trap composed of 299 places in 297 ms of which 1 ms to minimize.
[2023-03-21 22:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 825 ms
[2023-03-21 22:02:11] [INFO ] After 1362ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:11] [INFO ] After 1550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-21 22:02:12] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:12] [INFO ] Deduced a trap composed of 299 places in 379 ms of which 0 ms to minimize.
[2023-03-21 22:02:13] [INFO ] Deduced a trap composed of 299 places in 301 ms of which 1 ms to minimize.
[2023-03-21 22:02:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 820 ms
[2023-03-21 22:02:13] [INFO ] After 1545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-21 22:02:13] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 35 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 54 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 558 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 22 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2023-03-21 22:02:14] [INFO ] Invariant cache hit.
[2023-03-21 22:02:14] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-21 22:02:14] [INFO ] Invariant cache hit.
[2023-03-21 22:02:15] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-21 22:02:15] [INFO ] Invariant cache hit.
[2023-03-21 22:02:16] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2264 ms. Remains : 802/802 places, 1039/1039 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:02:17] [INFO ] Invariant cache hit.
[2023-03-21 22:02:17] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-21 22:02:18] [INFO ] After 487ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-21 22:02:18] [INFO ] Deduced a trap composed of 299 places in 358 ms of which 1 ms to minimize.
[2023-03-21 22:02:18] [INFO ] Deduced a trap composed of 299 places in 286 ms of which 1 ms to minimize.
[2023-03-21 22:02:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 789 ms
[2023-03-21 22:02:19] [INFO ] After 1311ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:19] [INFO ] After 1506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-21 22:02:19] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:20] [INFO ] Deduced a trap composed of 299 places in 366 ms of which 1 ms to minimize.
[2023-03-21 22:02:20] [INFO ] Deduced a trap composed of 299 places in 294 ms of which 0 ms to minimize.
[2023-03-21 22:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 789 ms
[2023-03-21 22:02:20] [INFO ] After 1506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-21 22:02:20] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 29 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 526 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1278 reset in 146 ms.
Product exploration explored 100000 steps with 1287 reset in 158 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 796 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 551 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 551 rules applied. Total rules applied 552 place count 746 transition count 975
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 560 place count 746 transition count 967
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 560 place count 746 transition count 971
Deduced a syphon composed of 584 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 593 place count 746 transition count 971
Discarding 497 places :
Symmetric choice reduction at 2 with 497 rule applications. Total rules 1090 place count 249 transition count 474
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 2 with 497 rules applied. Total rules applied 1587 place count 249 transition count 474
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1632 place count 249 transition count 486
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1706 place count 175 transition count 279
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 1780 place count 175 transition count 279
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1794 place count 175 transition count 265
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1825 place count 144 transition count 230
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1856 place count 144 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1868 place count 132 transition count 218
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1880 place count 132 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1884 place count 132 transition count 214
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1892 place count 124 transition count 206
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1900 place count 124 transition count 206
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1907 place count 124 transition count 241
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1918 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1929 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1937 place count 113 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1937 rules in 69 ms. Remains 113 /802 variables (removed 689) and now considering 211/1039 (removed 828) transitions.
[2023-03-21 22:02:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 22:02:22] [INFO ] Flow matrix only has 206 transitions (discarded 5 similar events)
// Phase 1: matrix 206 rows 113 cols
[2023-03-21 22:02:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 22:02:22] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/802 places, 211/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 113/802 places, 211/1039 transitions.
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 21 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2023-03-21 22:02:22] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-21 22:02:23] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-21 22:02:23] [INFO ] Invariant cache hit.
[2023-03-21 22:02:23] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-21 22:02:23] [INFO ] Invariant cache hit.
[2023-03-21 22:02:24] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 802/802 places, 1039/1039 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 19001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U G(p0)))'
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 823 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1166 place count 193 transition count 415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1166 place count 193 transition count 376
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1244 place count 154 transition count 376
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1251 place count 147 transition count 369
Iterating global reduction 3 with 7 rules applied. Total rules applied 1258 place count 147 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 147 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 146 transition count 368
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1320 place count 116 transition count 337
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1342 place count 94 transition count 224
Iterating global reduction 3 with 22 rules applied. Total rules applied 1364 place count 94 transition count 224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1372 place count 94 transition count 216
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1384 place count 82 transition count 200
Iterating global reduction 4 with 12 rules applied. Total rules applied 1396 place count 82 transition count 200
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1408 place count 70 transition count 184
Iterating global reduction 4 with 12 rules applied. Total rules applied 1420 place count 70 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1424 place count 70 transition count 180
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1440 place count 62 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1441 place count 61 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 1442 place count 61 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1443 place count 61 transition count 178
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1447 place count 61 transition count 174
Applied a total of 1447 rules in 38 ms. Remains 61 /829 variables (removed 768) and now considering 174/1068 (removed 894) transitions.
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
// Phase 1: matrix 169 rows 61 cols
[2023-03-21 22:02:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 22:02:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
[2023-03-21 22:02:25] [INFO ] Invariant cache hit.
[2023-03-21 22:02:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-21 22:02:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 169 transitions (discarded 5 similar events)
[2023-03-21 22:02:25] [INFO ] Invariant cache hit.
[2023-03-21 22:02:25] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/829 places, 174/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 61/829 places, 174/1068 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s21 1) (EQ s34 1) (EQ s47 1)), p1:(AND (NEQ s53 1) (NOT (AND (EQ s6 1) (EQ s21 1) (EQ s34 1) (EQ s47 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-14 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 829 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 827 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 771 transition count 426
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 591 rules applied. Total rules applied 1168 place count 195 transition count 411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1174 place count 189 transition count 411
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1174 place count 189 transition count 371
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1254 place count 149 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1260 place count 143 transition count 365
Iterating global reduction 3 with 6 rules applied. Total rules applied 1266 place count 143 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1266 place count 143 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1268 place count 142 transition count 364
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1328 place count 112 transition count 333
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1352 place count 88 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 1376 place count 88 transition count 183
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1387 place count 88 transition count 172
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1399 place count 76 transition count 156
Iterating global reduction 4 with 12 rules applied. Total rules applied 1411 place count 76 transition count 156
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1423 place count 64 transition count 140
Iterating global reduction 4 with 12 rules applied. Total rules applied 1435 place count 64 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1439 place count 64 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1455 place count 56 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1456 place count 55 transition count 135
Iterating global reduction 5 with 1 rules applied. Total rules applied 1457 place count 55 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1458 place count 55 transition count 134
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1462 place count 55 transition count 130
Applied a total of 1462 rules in 36 ms. Remains 55 /829 variables (removed 774) and now considering 130/1068 (removed 938) transitions.
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
// Phase 1: matrix 125 rows 55 cols
[2023-03-21 22:02:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 22:02:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2023-03-21 22:02:25] [INFO ] Invariant cache hit.
[2023-03-21 22:02:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:25] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-21 22:02:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 22:02:25] [INFO ] Flow matrix only has 125 transitions (discarded 5 similar events)
[2023-03-21 22:02:25] [INFO ] Invariant cache hit.
[2023-03-21 22:02:25] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/829 places, 130/1068 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 55/829 places, 130/1068 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-15 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-08
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 829 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 823 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 572 transitions
Trivial Post-agglo rules discarded 572 transitions
Performed 572 trivial Post agglomeration. Transition count delta: 572
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 771 transition count 430
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 587 rules applied. Total rules applied 1160 place count 199 transition count 415
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1166 place count 193 transition count 415
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 1166 place count 193 transition count 376
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1244 place count 154 transition count 376
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1251 place count 147 transition count 369
Iterating global reduction 3 with 7 rules applied. Total rules applied 1258 place count 147 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 147 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 146 transition count 368
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1320 place count 116 transition count 338
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1341 place count 95 transition count 252
Iterating global reduction 3 with 21 rules applied. Total rules applied 1362 place count 95 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1370 place count 95 transition count 244
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1382 place count 83 transition count 228
Iterating global reduction 4 with 12 rules applied. Total rules applied 1394 place count 83 transition count 228
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1406 place count 71 transition count 212
Iterating global reduction 4 with 12 rules applied. Total rules applied 1418 place count 71 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1422 place count 71 transition count 208
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1438 place count 63 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1439 place count 62 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 1440 place count 62 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1441 place count 62 transition count 206
Applied a total of 1441 rules in 37 ms. Remains 62 /829 variables (removed 767) and now considering 206/1068 (removed 862) transitions.
[2023-03-21 22:02:26] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2023-03-21 22:02:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:02:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 22:02:26] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:26] [INFO ] Invariant cache hit.
[2023-03-21 22:02:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-21 22:02:26] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:26] [INFO ] Invariant cache hit.
[2023-03-21 22:02:26] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/829 places, 206/1068 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 372 ms. Remains : 62/829 places, 206/1068 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s28 0), p0:(AND (EQ s6 1) (EQ s20 1) (EQ s36 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1663 reset in 92 ms.
Product exploration explored 100000 steps with 1162 reset in 90 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1358 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:02:27] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:27] [INFO ] Invariant cache hit.
[2023-03-21 22:02:27] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:02:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 22:02:27] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:02:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:27] [INFO ] After 26ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:02:27] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-21 22:02:27] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 206/206 transitions.
Graph (complete) has 273 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 61 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 57 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 57 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 56 transition count 168
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 49 rules applied. Total rules applied 99 place count 29 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 25 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 107 place count 21 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 21 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 21 transition count 141
Performed 8 Post agglomeration using F-continuation condition with reduction of 44 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 128 place count 13 transition count 89
Drop transitions removed 5 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 185 place count 13 transition count 32
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 189 place count 11 transition count 28
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 193 place count 11 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 11 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 195 place count 10 transition count 22
Applied a total of 195 rules in 23 ms. Remains 10 /62 variables (removed 52) and now considering 22/206 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 10/62 places, 22/206 transitions.
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 22:02:27] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:27] [INFO ] Invariant cache hit.
[2023-03-21 22:02:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-21 22:02:27] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:27] [INFO ] Invariant cache hit.
[2023-03-21 22:02:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:28] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-21 22:02:28] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:28] [INFO ] Invariant cache hit.
[2023-03-21 22:02:28] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 62/62 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1365 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 55440 steps, run visited all 2 properties in 127 ms. (steps per millisecond=436 )
Probabilistic random walk after 55440 steps, saw 14447 distinct states, run finished after 127 ms. (steps per millisecond=436 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1190 reset in 96 ms.
Product exploration explored 100000 steps with 843 reset in 95 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 202
Applied a total of 4 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 202/206 (removed 4) transitions.
[2023-03-21 22:02:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 22:02:29] [INFO ] Flow matrix only has 197 transitions (discarded 5 similar events)
// Phase 1: matrix 197 rows 62 cols
[2023-03-21 22:02:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:02:29] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 202/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 62/62 places, 202/206 transitions.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-21 22:02:29] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2023-03-21 22:02:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 22:02:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 22:02:30] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:30] [INFO ] Invariant cache hit.
[2023-03-21 22:02:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:30] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-21 22:02:30] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2023-03-21 22:02:30] [INFO ] Invariant cache hit.
[2023-03-21 22:02:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 62/62 places, 206/206 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 4207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-10
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 829 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 829/829 places, 1068/1068 transitions.
Graph (trivial) has 825 edges and 829 vertex of which 69 / 829 are part of one of the 12 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 574 rules applied. Total rules applied 575 place count 771 transition count 428
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 589 rules applied. Total rules applied 1164 place count 197 transition count 413
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1170 place count 191 transition count 413
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1170 place count 191 transition count 373
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1250 place count 151 transition count 373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1256 place count 145 transition count 367
Iterating global reduction 3 with 6 rules applied. Total rules applied 1262 place count 145 transition count 367
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1324 place count 114 transition count 335
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1348 place count 90 transition count 185
Iterating global reduction 3 with 24 rules applied. Total rules applied 1372 place count 90 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1382 place count 90 transition count 175
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1394 place count 78 transition count 159
Iterating global reduction 4 with 12 rules applied. Total rules applied 1406 place count 78 transition count 159
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1418 place count 66 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 1430 place count 66 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1434 place count 66 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1450 place count 58 transition count 146
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1451 place count 57 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 1452 place count 57 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1453 place count 57 transition count 137
Applied a total of 1453 rules in 33 ms. Remains 57 /829 variables (removed 772) and now considering 137/1068 (removed 931) transitions.
[2023-03-21 22:02:30] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2023-03-21 22:02:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:02:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-21 22:02:30] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:30] [INFO ] Invariant cache hit.
[2023-03-21 22:02:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:30] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-21 22:02:30] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:30] [INFO ] Invariant cache hit.
[2023-03-21 22:02:31] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 57/829 places, 137/1068 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 337 ms. Remains : 57/829 places, 137/1068 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 0), p2:(NEQ s9 1), p1:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 828 reset in 62 ms.
Product exploration explored 100000 steps with 2906 reset in 85 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:02:31] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:31] [INFO ] Invariant cache hit.
[2023-03-21 22:02:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 22:02:32] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-21 22:02:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:32] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:32] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 22:02:32] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:32] [INFO ] After 24ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:32] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-21 22:02:32] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 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 removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
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 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 19 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 543 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-21 22:02:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:33] [INFO ] Invariant cache hit.
[2023-03-21 22:02:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-21 22:02:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:33] [INFO ] Invariant cache hit.
[2023-03-21 22:02:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-21 22:02:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:33] [INFO ] Invariant cache hit.
[2023-03-21 22:02:33] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 57/57 places, 137/137 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 420 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 155 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:02:34] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:34] [INFO ] Invariant cache hit.
[2023-03-21 22:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 22:02:34] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-21 22:02:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:34] [INFO ] After 12ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:34] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 22:02:34] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:34] [INFO ] After 35ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:02:34] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-21 22:02:34] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 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 removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
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 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 18 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p2)), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p2))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 644 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 708 reset in 60 ms.
Product exploration explored 100000 steps with 87 reset in 65 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 133
Applied a total of 4 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 133/137 (removed 4) transitions.
[2023-03-21 22:02:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:02:36] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 57 cols
[2023-03-21 22:02:36] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:02:36] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 133/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 57/57 places, 133/137 transitions.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-21 22:02:36] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2023-03-21 22:02:36] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:02:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-21 22:02:36] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:36] [INFO ] Invariant cache hit.
[2023-03-21 22:02:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:02:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-21 22:02:36] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2023-03-21 22:02:36] [INFO ] Invariant cache hit.
[2023-03-21 22:02:36] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 57/57 places, 137/137 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 6527 ms.
[2023-03-21 22:02:36] [INFO ] Flatten gal took : 59 ms
[2023-03-21 22:02:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-21 22:02:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 829 places, 1068 transitions and 3322 arcs took 10 ms.
Total runtime 97724 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2265/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2265/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2265/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyCommit-PT-03b-LTLFireability-02
Could not compute solution for formula : StigmergyCommit-PT-03b-LTLFireability-08
Could not compute solution for formula : StigmergyCommit-PT-03b-LTLFireability-10

BK_STOP 1679436159337

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name StigmergyCommit-PT-03b-LTLFireability-02
ltl formula formula --ltl=/tmp/2265/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 829 places, 1068 transitions and 3322 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2265/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2265/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2265/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2265/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name StigmergyCommit-PT-03b-LTLFireability-08
ltl formula formula --ltl=/tmp/2265/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 829 places, 1068 transitions and 3322 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2265/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2265/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2265/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2265/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name StigmergyCommit-PT-03b-LTLFireability-10
ltl formula formula --ltl=/tmp/2265/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 829 places, 1068 transitions and 3322 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2265/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2265/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2265/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2265/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-03b"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-03b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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