Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872400116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r294-smll-165463872400116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 8.2K May 30 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 30 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 30 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 30 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 9.1K May 30 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 30 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 30 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 30 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 359K May 29 12:20 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 1654771867893

Running Version 202205111006
[2022-06-09 10:51:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 10:51:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:51:10] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2022-06-09 10:51:10] [INFO ] Transformed 1231 places.
[2022-06-09 10:51:10] [INFO ] Transformed 1476 transitions.
[2022-06-09 10:51:10] [INFO ] Found NUPN structural information;
[2022-06-09 10:51:10] [INFO ] Parsed PT model containing 1231 places and 1476 transitions in 678 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Support contains 44 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 1136 transition count 1381
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 1136 transition count 1381
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 249 place count 1077 transition count 1322
Iterating global reduction 0 with 59 rules applied. Total rules applied 308 place count 1077 transition count 1322
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 344 place count 1041 transition count 1286
Iterating global reduction 0 with 36 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 411 place count 1010 transition count 1255
Iterating global reduction 0 with 31 rules applied. Total rules applied 442 place count 1010 transition count 1255
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 468 place count 984 transition count 1229
Iterating global reduction 0 with 26 rules applied. Total rules applied 494 place count 984 transition count 1229
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 520 place count 958 transition count 1203
Iterating global reduction 0 with 26 rules applied. Total rules applied 546 place count 958 transition count 1203
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 571 place count 933 transition count 1178
Iterating global reduction 0 with 25 rules applied. Total rules applied 596 place count 933 transition count 1178
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 619 place count 910 transition count 1155
Iterating global reduction 0 with 23 rules applied. Total rules applied 642 place count 910 transition count 1155
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 662 place count 890 transition count 1135
Iterating global reduction 0 with 20 rules applied. Total rules applied 682 place count 890 transition count 1135
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 697 place count 875 transition count 1120
Iterating global reduction 0 with 15 rules applied. Total rules applied 712 place count 875 transition count 1120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 713 place count 875 transition count 1119
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 721 place count 867 transition count 1111
Iterating global reduction 1 with 8 rules applied. Total rules applied 729 place count 867 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 737 place count 859 transition count 1103
Iterating global reduction 1 with 8 rules applied. Total rules applied 745 place count 859 transition count 1103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 749 place count 855 transition count 1099
Iterating global reduction 1 with 4 rules applied. Total rules applied 753 place count 855 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 757 place count 851 transition count 1095
Iterating global reduction 1 with 4 rules applied. Total rules applied 761 place count 851 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 764 place count 848 transition count 1092
Iterating global reduction 1 with 3 rules applied. Total rules applied 767 place count 848 transition count 1092
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 770 place count 845 transition count 1089
Iterating global reduction 1 with 3 rules applied. Total rules applied 773 place count 845 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 776 place count 842 transition count 1086
Iterating global reduction 1 with 3 rules applied. Total rules applied 779 place count 842 transition count 1086
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 782 place count 839 transition count 1083
Iterating global reduction 1 with 3 rules applied. Total rules applied 785 place count 839 transition count 1083
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 787 place count 837 transition count 1081
Iterating global reduction 1 with 2 rules applied. Total rules applied 789 place count 837 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 791 place count 835 transition count 1079
Iterating global reduction 1 with 2 rules applied. Total rules applied 793 place count 835 transition count 1079
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 795 place count 833 transition count 1077
Iterating global reduction 1 with 2 rules applied. Total rules applied 797 place count 833 transition count 1077
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 799 place count 831 transition count 1075
Iterating global reduction 1 with 2 rules applied. Total rules applied 801 place count 831 transition count 1075
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 803 place count 831 transition count 1073
Applied a total of 803 rules in 1813 ms. Remains 831 /1231 variables (removed 400) and now considering 1073/1476 (removed 403) transitions.
// Phase 1: matrix 1073 rows 831 cols
[2022-06-09 10:51:13] [INFO ] Computed 5 place invariants in 45 ms
[2022-06-09 10:51:13] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 1073 rows 831 cols
[2022-06-09 10:51:14] [INFO ] Computed 5 place invariants in 19 ms
[2022-06-09 10:51:15] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
// Phase 1: matrix 1073 rows 831 cols
[2022-06-09 10:51:15] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:51:16] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 831/1231 places, 1073/1476 transitions.
Finished structural reductions, in 1 iterations. Remains : 831/1231 places, 1073/1476 transitions.
Support contains 44 out of 831 places after structural reductions.
[2022-06-09 10:51:17] [INFO ] Flatten gal took : 247 ms
[2022-06-09 10:51:17] [INFO ] Flatten gal took : 135 ms
[2022-06-09 10:51:17] [INFO ] Input system was already deterministic with 1073 transitions.
Support contains 43 out of 831 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 914 ms. (steps per millisecond=10 ) properties (out of 35) seen :10
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1073 rows 831 cols
[2022-06-09 10:51:18] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2022-06-09 10:51:20] [INFO ] After 991ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:19
[2022-06-09 10:51:21] [INFO ] Deduced a trap composed of 400 places in 862 ms of which 9 ms to minimize.
[2022-06-09 10:51:22] [INFO ] Deduced a trap composed of 403 places in 653 ms of which 3 ms to minimize.
[2022-06-09 10:51:22] [INFO ] Deduced a trap composed of 299 places in 493 ms of which 3 ms to minimize.
[2022-06-09 10:51:23] [INFO ] Deduced a trap composed of 312 places in 718 ms of which 3 ms to minimize.
[2022-06-09 10:51:24] [INFO ] Deduced a trap composed of 307 places in 489 ms of which 2 ms to minimize.
[2022-06-09 10:51:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3754 ms
[2022-06-09 10:51:25] [INFO ] Deduced a trap composed of 304 places in 635 ms of which 2 ms to minimize.
[2022-06-09 10:51:25] [INFO ] Deduced a trap composed of 307 places in 436 ms of which 1 ms to minimize.
[2022-06-09 10:51:26] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 1 ms to minimize.
[2022-06-09 10:51:26] [INFO ] Deduced a trap composed of 306 places in 508 ms of which 1 ms to minimize.
[2022-06-09 10:51:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2326 ms
[2022-06-09 10:51:27] [INFO ] Deduced a trap composed of 305 places in 501 ms of which 1 ms to minimize.
[2022-06-09 10:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 676 ms
[2022-06-09 10:51:28] [INFO ] After 8437ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:25
[2022-06-09 10:51:28] [INFO ] After 9442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2022-06-09 10:51:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2022-06-09 10:51:31] [INFO ] After 2302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2022-06-09 10:51:33] [INFO ] Deduced a trap composed of 305 places in 845 ms of which 1 ms to minimize.
[2022-06-09 10:51:34] [INFO ] Deduced a trap composed of 304 places in 618 ms of which 1 ms to minimize.
[2022-06-09 10:51:34] [INFO ] Deduced a trap composed of 305 places in 401 ms of which 1 ms to minimize.
[2022-06-09 10:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2114 ms
[2022-06-09 10:51:35] [INFO ] Deduced a trap composed of 313 places in 529 ms of which 2 ms to minimize.
[2022-06-09 10:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 698 ms
[2022-06-09 10:51:36] [INFO ] Deduced a trap composed of 312 places in 529 ms of which 3 ms to minimize.
[2022-06-09 10:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 681 ms
[2022-06-09 10:51:37] [INFO ] Deduced a trap composed of 308 places in 559 ms of which 1 ms to minimize.
[2022-06-09 10:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2022-06-09 10:51:38] [INFO ] Deduced a trap composed of 302 places in 603 ms of which 1 ms to minimize.
[2022-06-09 10:51:38] [INFO ] Deduced a trap composed of 301 places in 546 ms of which 1 ms to minimize.
[2022-06-09 10:51:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1351 ms
[2022-06-09 10:51:39] [INFO ] After 10166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 1681 ms.
[2022-06-09 10:51:41] [INFO ] After 13350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 12 properties in 319 ms.
Support contains 17 out of 831 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Graph (trivial) has 803 edges and 831 vertex of which 46 / 831 are part of one of the 9 SCC in 8 ms
Free SCC test removed 37 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 1254 edges and 794 vertex of which 790 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.93 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 574 rules applied. Total rules applied 576 place count 790 transition count 449
Reduce places removed 570 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 579 rules applied. Total rules applied 1155 place count 220 transition count 440
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1162 place count 216 transition count 437
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 1169 place count 213 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1171 place count 211 transition count 433
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 1171 place count 211 transition count 385
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 1267 place count 163 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1268 place count 162 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 1269 place count 162 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1269 place count 162 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1271 place count 161 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1272 place count 161 transition count 382
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1273 place count 160 transition count 355
Iterating global reduction 6 with 1 rules applied. Total rules applied 1274 place count 160 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1275 place count 160 transition count 354
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 1339 place count 128 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1345 place count 128 transition count 316
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 1362 place count 111 transition count 231
Iterating global reduction 8 with 17 rules applied. Total rules applied 1379 place count 111 transition count 231
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1386 place count 111 transition count 224
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1395 place count 102 transition count 215
Iterating global reduction 9 with 9 rules applied. Total rules applied 1404 place count 102 transition count 215
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 1412 place count 94 transition count 207
Iterating global reduction 9 with 8 rules applied. Total rules applied 1420 place count 94 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1424 place count 94 transition count 203
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 1438 place count 87 transition count 196
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1448 place count 82 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1449 place count 82 transition count 217
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1453 place count 82 transition count 213
Free-agglomeration rule applied 31 times with reduction of 4 identical transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 1484 place count 82 transition count 178
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 38 rules applied. Total rules applied 1522 place count 51 transition count 171
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1525 place count 48 transition count 168
Iterating global reduction 12 with 3 rules applied. Total rules applied 1528 place count 48 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1529 place count 48 transition count 167
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1566 place count 48 transition count 130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1570 place count 48 transition count 130
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1573 place count 48 transition count 127
Applied a total of 1573 rules in 280 ms. Remains 48 /831 variables (removed 783) and now considering 127/1073 (removed 946) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/831 places, 127/1073 transitions.
Finished random walk after 1598 steps, including 0 resets, run visited all 13 properties in 47 ms. (steps per millisecond=34 )
Computed a total of 165 stabilizing places and 173 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 3 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 804 transition count 1045
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 804 transition count 1045
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 804 transition count 1044
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 799 transition count 1039
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 799 transition count 1039
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 799 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 796 transition count 1034
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 796 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 794 transition count 1032
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 793 transition count 1031
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 792 transition count 1030
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 792 transition count 1029
Applied a total of 83 rules in 749 ms. Remains 792 /831 variables (removed 39) and now considering 1029/1073 (removed 44) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:51:43] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:51:43] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:51:43] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:51:44] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:51:44] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:51:45] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 792/831 places, 1029/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 792/831 places, 1029/1073 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
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: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s425 0), p1:(OR (EQ s505 1) (EQ s347 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 3223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 800 transition count 1041
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 800 transition count 1041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 800 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 797 transition count 1036
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 795 transition count 1034
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 794 transition count 1033
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 794 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 793 transition count 1032
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 793 transition count 1031
Applied a total of 80 rules in 328 ms. Remains 793 /831 variables (removed 38) and now considering 1031/1073 (removed 42) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:46] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:51:46] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:46] [INFO ] Computed 5 place invariants in 10 ms
[2022-06-09 10:51:47] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:47] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:51:48] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 793/831 places, 1031/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 793/831 places, 1031/1073 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-01 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: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s154 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][false, false, false, false]]
Product exploration explored 100000 steps with 1287 reset in 690 ms.
Product exploration explored 100000 steps with 1288 reset in 456 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659457 steps, run timeout after 3006 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659457 steps, saw 125376 distinct states, run finished after 3022 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:53] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:51:53] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-06-09 10:51:54] [INFO ] After 664ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:51:55] [INFO ] Deduced a trap composed of 302 places in 719 ms of which 2 ms to minimize.
[2022-06-09 10:51:55] [INFO ] Deduced a trap composed of 299 places in 500 ms of which 1 ms to minimize.
[2022-06-09 10:51:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1477 ms
[2022-06-09 10:51:55] [INFO ] After 2194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:51:55] [INFO ] After 2410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:51:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2022-06-09 10:51:56] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:51:57] [INFO ] Deduced a trap composed of 302 places in 638 ms of which 1 ms to minimize.
[2022-06-09 10:51:57] [INFO ] Deduced a trap composed of 299 places in 364 ms of which 0 ms to minimize.
[2022-06-09 10:51:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1219 ms
[2022-06-09 10:51:57] [INFO ] After 1873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-06-09 10:51:57] [INFO ] After 2113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 793/793 places, 1031/1031 transitions.
Graph (trivial) has 791 edges and 793 vertex of which 68 / 793 are part of one of the 12 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1184 edges and 737 vertex of which 733 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 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 557 rules applied. Total rules applied 559 place count 733 transition count 398
Reduce places removed 553 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 565 rules applied. Total rules applied 1124 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1128 place count 176 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 1128 place count 176 transition count 341
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1218 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1219 place count 131 transition count 340
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 1279 place count 101 transition count 310
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 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1312 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1337 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1350 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1362 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1374 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1382 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1390 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1394 place count 56 transition count 111
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 1402 place count 52 transition count 107
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 1410 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1432 place count 48 transition count 100
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 7 with 41 rules applied. Total rules applied 1473 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1477 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1481 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1482 place count 22 transition count 76
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1509 place count 22 transition count 49
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 1513 place count 20 transition count 67
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1519 place count 20 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1521 place count 20 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1522 place count 20 transition count 60
Applied a total of 1522 rules in 119 ms. Remains 20 /793 variables (removed 773) and now considering 60/1031 (removed 971) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/793 places, 60/1031 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 793/793 places, 1031/1031 transitions.
Applied a total of 0 rules in 42 ms. Remains 793 /793 variables (removed 0) and now considering 1031/1031 (removed 0) transitions.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:58] [INFO ] Computed 5 place invariants in 15 ms
[2022-06-09 10:51:58] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:51:58] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:52:00] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:52:00] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:52:01] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 793/793 places, 1031/1031 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596410 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596410 steps, saw 114436 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1031 rows 793 cols
[2022-06-09 10:52:04] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:52:04] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-06-09 10:52:05] [INFO ] After 630ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:52:06] [INFO ] Deduced a trap composed of 302 places in 517 ms of which 1 ms to minimize.
[2022-06-09 10:52:06] [INFO ] Deduced a trap composed of 299 places in 467 ms of which 1 ms to minimize.
[2022-06-09 10:52:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1200 ms
[2022-06-09 10:52:06] [INFO ] After 1879ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:06] [INFO ] After 2070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2022-06-09 10:52:07] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:52:08] [INFO ] Deduced a trap composed of 302 places in 607 ms of which 1 ms to minimize.
[2022-06-09 10:52:09] [INFO ] Deduced a trap composed of 299 places in 507 ms of which 1 ms to minimize.
[2022-06-09 10:52:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1350 ms
[2022-06-09 10:52:09] [INFO ] After 2118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-06-09 10:52:09] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 793/793 places, 1031/1031 transitions.
Graph (trivial) has 791 edges and 793 vertex of which 68 / 793 are part of one of the 12 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1184 edges and 737 vertex of which 733 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 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 557 rules applied. Total rules applied 559 place count 733 transition count 398
Reduce places removed 553 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 565 rules applied. Total rules applied 1124 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1128 place count 176 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 1128 place count 176 transition count 341
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1218 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1219 place count 131 transition count 340
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1279 place count 101 transition count 310
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 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1312 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1337 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1350 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1362 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1374 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1382 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1390 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1394 place count 56 transition count 111
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 1402 place count 52 transition count 107
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 1410 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1432 place count 48 transition count 100
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 7 with 41 rules applied. Total rules applied 1473 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1477 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1481 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1482 place count 22 transition count 76
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1509 place count 22 transition count 49
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 1513 place count 20 transition count 67
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1519 place count 20 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1521 place count 20 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1522 place count 20 transition count 60
Applied a total of 1522 rules in 78 ms. Remains 20 /793 variables (removed 773) and now considering 60/1031 (removed 971) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/793 places, 60/1031 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1284 reset in 222 ms.
Product exploration explored 100000 steps with 1276 reset in 258 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 793/793 places, 1031/1031 transitions.
Graph (trivial) has 791 edges and 793 vertex of which 68 / 793 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 545 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 545 rules applied. Total rules applied 546 place count 737 transition count 967
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 554 place count 737 transition count 959
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 554 place count 737 transition count 963
Deduced a syphon composed of 577 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 586 place count 737 transition count 963
Discarding 489 places :
Symmetric choice reduction at 2 with 489 rule applications. Total rules 1075 place count 248 transition count 474
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 489 rules applied. Total rules applied 1564 place count 248 transition count 474
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 1610 place count 248 transition count 487
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1685 place count 173 transition count 279
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 1760 place count 173 transition count 279
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1777 place count 173 transition count 262
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1810 place count 140 transition count 225
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 1843 place count 140 transition count 225
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1855 place count 128 transition count 213
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1867 place count 128 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1871 place count 128 transition count 209
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1879 place count 120 transition count 201
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1887 place count 120 transition count 201
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1894 place count 120 transition count 236
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1905 place count 109 transition count 214
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1916 place count 109 transition count 214
Deduced a syphon composed of 54 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 1924 place count 109 transition count 206
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 1924 rules in 145 ms. Remains 109 /793 variables (removed 684) and now considering 206/1031 (removed 825) transitions.
[2022-06-09 10:52:11] [INFO ] Redundant transitions in 9 ms returned []
[2022-06-09 10:52:11] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 109 cols
[2022-06-09 10:52:11] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 10:52:11] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/793 places, 206/1031 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/793 places, 206/1031 transitions.
Entered a terminal (fully accepting) state of product in 58694 steps with 5149 reset in 624 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-01 finished in 26144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((p0 U X(X(!X(!p0))))))))))'
Support contains 1 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 800 transition count 1040
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 800 transition count 1040
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 800 transition count 1038
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 797 transition count 1035
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 797 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 795 transition count 1033
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 795 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 794 transition count 1032
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 793 transition count 1031
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 793 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 793 transition count 1030
Applied a total of 81 rules in 260 ms. Remains 793 /831 variables (removed 38) and now considering 1030/1073 (removed 43) transitions.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:12] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:52:12] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:12] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:52:13] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:13] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:52:14] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 793/831 places, 1030/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 793/831 places, 1030/1073 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 6}, { cond=(NOT p0), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(NEQ s134 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1282 reset in 260 ms.
Product exploration explored 100000 steps with 1270 reset in 480 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 8 states, 16 edges and 1 AP to 8 states, 16 edges and 1 AP.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 691127 steps, run timeout after 3002 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 691127 steps, saw 130831 distinct states, run finished after 3003 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:19] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:52:19] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2022-06-09 10:52:20] [INFO ] After 576ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:52:20] [INFO ] Deduced a trap composed of 299 places in 604 ms of which 1 ms to minimize.
[2022-06-09 10:52:21] [INFO ] Deduced a trap composed of 299 places in 477 ms of which 1 ms to minimize.
[2022-06-09 10:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1303 ms
[2022-06-09 10:52:21] [INFO ] After 1935ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:21] [INFO ] After 2108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-06-09 10:52:22] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:52:22] [INFO ] Deduced a trap composed of 299 places in 485 ms of which 1 ms to minimize.
[2022-06-09 10:52:23] [INFO ] Deduced a trap composed of 299 places in 419 ms of which 1 ms to minimize.
[2022-06-09 10:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1106 ms
[2022-06-09 10:52:23] [INFO ] After 1871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-06-09 10:52:23] [INFO ] After 2208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 793/793 places, 1030/1030 transitions.
Graph (trivial) has 790 edges and 793 vertex of which 68 / 793 are part of one of the 12 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1183 edges and 737 vertex of which 733 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 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 557 rules applied. Total rules applied 559 place count 733 transition count 397
Reduce places removed 553 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 564 rules applied. Total rules applied 1123 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1127 place count 176 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 1127 place count 176 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 1217 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1218 place count 131 transition count 340
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 1278 place count 101 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1286 place count 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1311 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1336 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1349 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1361 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1373 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1381 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1389 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1393 place count 56 transition count 111
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 1401 place count 52 transition count 107
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 1409 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1431 place count 48 transition count 100
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 7 with 41 rules applied. Total rules applied 1472 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1476 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1480 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1481 place count 22 transition count 76
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1508 place count 22 transition count 49
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 1512 place count 20 transition count 67
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1518 place count 20 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1520 place count 20 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1521 place count 20 transition count 60
Applied a total of 1521 rules in 75 ms. Remains 20 /793 variables (removed 773) and now considering 60/1030 (removed 970) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/793 places, 60/1030 transitions.
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 8 states, 16 edges and 1 AP to 8 states, 16 edges and 1 AP.
Stuttering acceptance computed with spot in 424 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 793/793 places, 1030/1030 transitions.
Applied a total of 0 rules in 25 ms. Remains 793 /793 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:24] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:52:25] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:25] [INFO ] Computed 5 place invariants in 17 ms
[2022-06-09 10:52:26] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:26] [INFO ] Computed 5 place invariants in 10 ms
[2022-06-09 10:52:27] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 793/793 places, 1030/1030 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 8 states, 16 edges and 1 AP to 8 states, 16 edges and 1 AP.
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 674709 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 674709 steps, saw 128015 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:30] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:52:30] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2022-06-09 10:52:31] [INFO ] After 731ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:52:32] [INFO ] Deduced a trap composed of 299 places in 573 ms of which 14 ms to minimize.
[2022-06-09 10:52:32] [INFO ] Deduced a trap composed of 299 places in 454 ms of which 4 ms to minimize.
[2022-06-09 10:52:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1266 ms
[2022-06-09 10:52:33] [INFO ] After 2050ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:33] [INFO ] After 2295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:52:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2022-06-09 10:52:33] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:52:34] [INFO ] Deduced a trap composed of 299 places in 568 ms of which 2 ms to minimize.
[2022-06-09 10:52:35] [INFO ] Deduced a trap composed of 299 places in 470 ms of which 1 ms to minimize.
[2022-06-09 10:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1251 ms
[2022-06-09 10:52:35] [INFO ] After 1953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-06-09 10:52:35] [INFO ] After 2245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 793/793 places, 1030/1030 transitions.
Graph (trivial) has 790 edges and 793 vertex of which 68 / 793 are part of one of the 12 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1183 edges and 737 vertex of which 733 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 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 557 rules applied. Total rules applied 559 place count 733 transition count 397
Reduce places removed 553 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 564 rules applied. Total rules applied 1123 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1127 place count 176 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 1127 place count 176 transition count 341
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1217 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1218 place count 131 transition count 340
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 1278 place count 101 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1286 place count 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1311 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1336 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1349 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1361 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1373 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1381 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1389 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1393 place count 56 transition count 111
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 1401 place count 52 transition count 107
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 1409 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1431 place count 48 transition count 100
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 7 with 41 rules applied. Total rules applied 1472 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1476 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1480 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1481 place count 22 transition count 76
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1508 place count 22 transition count 49
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 1512 place count 20 transition count 67
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1518 place count 20 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1520 place count 20 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1521 place count 20 transition count 60
Applied a total of 1521 rules in 55 ms. Remains 20 /793 variables (removed 773) and now considering 60/1030 (removed 970) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/793 places, 60/1030 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 8 states, 16 edges and 1 AP to 8 states, 16 edges and 1 AP.
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1273 reset in 207 ms.
Product exploration explored 100000 steps with 1270 reset in 244 ms.
Built C files in :
/tmp/ltsmin14626601889977617548
[2022-06-09 10:52:37] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14626601889977617548
Running compilation step : cd /tmp/ltsmin14626601889977617548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14626601889977617548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14626601889977617548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 793/793 places, 1030/1030 transitions.
Applied a total of 0 rules in 25 ms. Remains 793 /793 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:40] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:52:40] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:40] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-09 10:52:41] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
// Phase 1: matrix 1030 rows 793 cols
[2022-06-09 10:52:41] [INFO ] Computed 5 place invariants in 13 ms
[2022-06-09 10:52:42] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 793/793 places, 1030/1030 transitions.
Built C files in :
/tmp/ltsmin4073918984167386279
[2022-06-09 10:52:42] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4073918984167386279
Running compilation step : cd /tmp/ltsmin4073918984167386279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2664 ms.
Running link step : cd /tmp/ltsmin4073918984167386279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin4073918984167386279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13619357232537108475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 10:52:57] [INFO ] Flatten gal took : 94 ms
[2022-06-09 10:52:58] [INFO ] Flatten gal took : 80 ms
[2022-06-09 10:52:58] [INFO ] Time to serialize gal into /tmp/LTL6735755315116402055.gal : 24 ms
[2022-06-09 10:52:58] [INFO ] Time to serialize properties into /tmp/LTL13970248554738635023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6735755315116402055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13970248554738635023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6735755...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(X(("(p166!=1)")U(X(X(!(X("(p166==1)"))))))))))))
Formula 0 simplified : !FGXGX("(p166!=1)" U XX!X"(p166==1)")
Detected timeout of ITS tools.
[2022-06-09 10:53:13] [INFO ] Flatten gal took : 47 ms
[2022-06-09 10:53:13] [INFO ] Applying decomposition
[2022-06-09 10:53:13] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15861510154924997331.txt' '-o' '/tmp/graph15861510154924997331.bin' '-w' '/tmp/graph15861510154924997331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15861510154924997331.bin' '-l' '-1' '-v' '-w' '/tmp/graph15861510154924997331.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:53:13] [INFO ] Decomposing Gal with order
[2022-06-09 10:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:53:13] [INFO ] Removed a total of 859 redundant transitions.
[2022-06-09 10:53:13] [INFO ] Flatten gal took : 183 ms
[2022-06-09 10:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 23 ms.
[2022-06-09 10:53:13] [INFO ] Time to serialize gal into /tmp/LTL3473274444969247008.gal : 23 ms
[2022-06-09 10:53:13] [INFO ] Time to serialize properties into /tmp/LTL11267040613093377879.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3473274444969247008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11267040613093377879.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3473274...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(X(("(i5.u56.p166!=1)")U(X(X(!(X("(i5.u56.p166==1)"))))))))))))
Formula 0 simplified : !FGXGX("(i5.u56.p166!=1)" U XX!X"(i5.u56.p166==1)")
Reverse transition relation is NOT exact ! Due to transitions t77, t163, t164, t220, t254, t400, t434, t526, t618, t660, t773, t793, t794, t797, t800, t803...574
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10638808263454952675
[2022-06-09 10:53:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10638808263454952675
Running compilation step : cd /tmp/ltsmin10638808263454952675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10638808263454952675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10638808263454952675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 79990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 819 transition count 1061
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 819 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 819 transition count 1060
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 809 transition count 1050
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 809 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 802 transition count 1043
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 802 transition count 1042
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 798 transition count 1038
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 798 transition count 1038
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 798 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 796 transition count 1034
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 795 transition count 1033
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 795 transition count 1033
Applied a total of 76 rules in 247 ms. Remains 795 /831 variables (removed 36) and now considering 1033/1073 (removed 40) transitions.
// Phase 1: matrix 1033 rows 795 cols
[2022-06-09 10:53:32] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:32] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1033 rows 795 cols
[2022-06-09 10:53:32] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:33] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
// Phase 1: matrix 1033 rows 795 cols
[2022-06-09 10:53:33] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:53:34] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 795/831 places, 1033/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 795/831 places, 1033/1073 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s347 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 3119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Graph (trivial) has 830 edges and 831 vertex of which 70 / 831 are part of one of the 12 SCC in 2 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 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 772 transition count 434
Reduce places removed 572 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 584 rules applied. Total rules applied 1157 place count 200 transition count 422
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 1164 place count 195 transition count 420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1166 place count 193 transition count 420
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1166 place count 193 transition count 379
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1248 place count 152 transition count 379
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1254 place count 146 transition count 373
Iterating global reduction 4 with 6 rules applied. Total rules applied 1260 place count 146 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1260 place count 146 transition count 372
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 1262 place count 145 transition count 372
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1264 place count 143 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 1266 place count 143 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1268 place count 143 transition count 342
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1330 place count 112 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1331 place count 112 transition count 307
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1354 place count 89 transition count 184
Iterating global reduction 6 with 23 rules applied. Total rules applied 1377 place count 89 transition count 184
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1387 place count 89 transition count 174
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1399 place count 77 transition count 158
Iterating global reduction 7 with 12 rules applied. Total rules applied 1411 place count 77 transition count 158
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1423 place count 65 transition count 142
Iterating global reduction 7 with 12 rules applied. Total rules applied 1435 place count 65 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1439 place count 65 transition count 138
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1457 place count 56 transition count 151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1458 place count 55 transition count 143
Iterating global reduction 8 with 1 rules applied. Total rules applied 1459 place count 55 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1460 place count 55 transition count 142
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1464 place count 55 transition count 138
Applied a total of 1464 rules in 53 ms. Remains 55 /831 variables (removed 776) and now considering 138/1073 (removed 935) transitions.
[2022-06-09 10:53:35] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 55 cols
[2022-06-09 10:53:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 10:53:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-06-09 10:53:35] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 55 cols
[2022-06-09 10:53:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:53:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 10:53:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-09 10:53:35] [INFO ] Redundant transitions in 5 ms returned []
[2022-06-09 10:53:35] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 55 cols
[2022-06-09 10:53:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:53:35] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/831 places, 138/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/831 places, 138/1073 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s46 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-04 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)||p1))&&X(p2))))'
Support contains 2 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 805 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 801 transition count 1041
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 801 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 798 transition count 1037
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 798 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 796 transition count 1035
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 796 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 795 transition count 1034
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 794 transition count 1033
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 794 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 794 transition count 1032
Applied a total of 78 rules in 383 ms. Remains 794 /831 variables (removed 37) and now considering 1032/1073 (removed 41) transitions.
// Phase 1: matrix 1032 rows 794 cols
[2022-06-09 10:53:35] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:36] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 1032 rows 794 cols
[2022-06-09 10:53:36] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:53:37] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
// Phase 1: matrix 1032 rows 794 cols
[2022-06-09 10:53:37] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:53:38] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 794/831 places, 1032/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 794/831 places, 1032/1073 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(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}]], initial=1, aps=[p1:(EQ s564 1), p0:(EQ s733 1), p2:(EQ s564 0)], 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][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-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-05 finished in 2976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!G(F((F(p1)||G(p2)))) U p1)))'
Support contains 3 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 802 transition count 1042
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 802 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 800 transition count 1039
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 799 transition count 1038
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 798 transition count 1037
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 797 transition count 1036
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 797 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 797 transition count 1035
Applied a total of 72 rules in 276 ms. Remains 797 /831 variables (removed 34) and now considering 1035/1073 (removed 38) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2022-06-09 10:53:38] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:53:39] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 1035 rows 797 cols
[2022-06-09 10:53:39] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:40] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
// Phase 1: matrix 1035 rows 797 cols
[2022-06-09 10:53:40] [INFO ] Computed 5 place invariants in 12 ms
[2022-06-09 10:53:41] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/831 places, 1035/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 797/831 places, 1035/1073 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p0), (OR p1 p2), p2, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s739 1), p0:(EQ s610 1), p2:(EQ s520 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]]
Product exploration explored 100000 steps with 1278 reset in 300 ms.
Product exploration explored 100000 steps with 1286 reset in 288 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 (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 638 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p0) p1), (OR p1 p2), p2, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1035 rows 797 cols
[2022-06-09 10:53:44] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:44] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-06-09 10:53:45] [INFO ] After 833ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-06-09 10:53:46] [INFO ] Deduced a trap composed of 297 places in 809 ms of which 2 ms to minimize.
[2022-06-09 10:53:46] [INFO ] Deduced a trap composed of 305 places in 775 ms of which 1 ms to minimize.
[2022-06-09 10:53:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1842 ms
[2022-06-09 10:53:47] [INFO ] After 2861ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-09 10:53:47] [INFO ] After 3170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-09 10:53:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-06-09 10:53:48] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-09 10:53:49] [INFO ] Deduced a trap composed of 299 places in 788 ms of which 2 ms to minimize.
[2022-06-09 10:53:50] [INFO ] Deduced a trap composed of 298 places in 836 ms of which 2 ms to minimize.
[2022-06-09 10:53:51] [INFO ] Deduced a trap composed of 297 places in 748 ms of which 1 ms to minimize.
[2022-06-09 10:53:51] [INFO ] Deduced a trap composed of 297 places in 653 ms of which 0 ms to minimize.
[2022-06-09 10:53:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3377 ms
[2022-06-09 10:53:52] [INFO ] After 4593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-06-09 10:53:52] [INFO ] After 5157ms 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 0 properties in 19 ms.
Support contains 3 out of 797 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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
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 7 transitions
Reduce isomorphic transitions removed 7 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 565 rules applied. Total rules applied 1125 place count 183 transition count 390
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1130 place count 179 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1131 place count 178 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1131 place count 178 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1221 place count 133 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1222 place count 133 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 5 with 58 rules applied. Total rules applied 1280 place count 104 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1288 place count 104 transition count 306
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 25 rules applied. Total rules applied 1338 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 1351 place count 79 transition count 139
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1363 place count 67 transition count 127
Iterating global reduction 7 with 12 rules applied. Total rules applied 1375 place count 67 transition count 127
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1383 place count 59 transition count 119
Iterating global reduction 7 with 8 rules applied. Total rules applied 1391 place count 59 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1395 place count 59 transition count 115
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 8 with 8 rules applied. Total rules applied 1403 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 1411 place count 51 transition count 132
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1412 place count 51 transition count 131
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1434 place count 51 transition count 102
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1466 place count 29 transition count 92
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1470 place count 25 transition count 88
Iterating global reduction 9 with 4 rules applied. Total rules applied 1474 place count 25 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1475 place count 25 transition count 87
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1499 place count 25 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 1501 place count 24 transition count 72
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 70
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1507 place count 24 transition count 70
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1509 place count 24 transition count 68
Applied a total of 1509 rules in 37 ms. Remains 24 /797 variables (removed 773) and now considering 68/1035 (removed 967) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/797 places, 68/1035 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 826 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p0) p1), (OR p1 p2), p2, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p0) p1), (OR p1 p2), p2, (AND p0 (NOT p1))]
// Phase 1: matrix 1035 rows 797 cols
[2022-06-09 10:53:53] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:53:54] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 310 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03b-LTLFireability-06 finished in 16236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&F(p1)&&F(p2))))'
Support contains 4 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 819 transition count 1061
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 819 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 819 transition count 1060
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 809 transition count 1050
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 809 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 802 transition count 1043
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 802 transition count 1042
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 797 transition count 1037
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 797 transition count 1037
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 797 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 794 transition count 1032
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 794 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 792 transition count 1030
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 791 transition count 1029
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 790 transition count 1028
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 790 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 790 transition count 1027
Applied a total of 87 rules in 351 ms. Remains 790 /831 variables (removed 41) and now considering 1027/1073 (removed 46) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:55] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:55] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:55] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:53:56] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:56] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:53:57] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/831 places, 1027/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 790/831 places, 1027/1073 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s157 1), p2:(AND (EQ s367 1) (EQ s789 1)), p0:(EQ s399 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 3402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 6 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 819 transition count 1061
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 819 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 819 transition count 1060
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 809 transition count 1050
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 809 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 802 transition count 1043
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 802 transition count 1042
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 797 transition count 1037
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 797 transition count 1037
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 797 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 794 transition count 1032
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 794 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 792 transition count 1030
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 791 transition count 1029
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 790 transition count 1028
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 790 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 790 transition count 1027
Applied a total of 87 rules in 380 ms. Remains 790 /831 variables (removed 41) and now considering 1027/1073 (removed 46) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:58] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:53:58] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:58] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:53:59] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
// Phase 1: matrix 1027 rows 790 cols
[2022-06-09 10:53:59] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:54:01] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/831 places, 1027/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 790/831 places, 1027/1073 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s14 1) (OR (EQ s42 0) (EQ s256 0) (EQ s407 0) (EQ s642 0))), p1:(EQ s716 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][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-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 3430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F(X(p1))||(p2 U p1))))'
Support contains 2 out of 831 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 821 transition count 1063
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 821 transition count 1063
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 812 transition count 1054
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 812 transition count 1054
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 806 transition count 1048
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 806 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 806 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 802 transition count 1043
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 802 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 802 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 799 transition count 1039
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 799 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 797 transition count 1037
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 797 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 796 transition count 1036
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 796 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 795 transition count 1035
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 795 transition count 1034
Applied a total of 75 rules in 372 ms. Remains 795 /831 variables (removed 36) and now considering 1034/1073 (removed 39) transitions.
// Phase 1: matrix 1034 rows 795 cols
[2022-06-09 10:54:01] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:54:02] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 1034 rows 795 cols
[2022-06-09 10:54:02] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:54:03] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
// Phase 1: matrix 1034 rows 795 cols
[2022-06-09 10:54:03] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-09 10:54:04] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 795/831 places, 1034/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 795/831 places, 1034/1073 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s327 1), p1:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][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-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-09 finished in 3244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 1 out of 831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Graph (trivial) has 832 edges and 831 vertex of which 70 / 831 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 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 772 transition count 432
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 587 rules applied. Total rules applied 1162 place count 198 transition count 419
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1168 place count 193 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1169 place count 192 transition count 418
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1169 place count 192 transition count 377
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1251 place count 151 transition count 377
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1257 place count 145 transition count 371
Iterating global reduction 4 with 6 rules applied. Total rules applied 1263 place count 145 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1263 place count 145 transition count 370
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 1265 place count 144 transition count 370
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1267 place count 142 transition count 342
Iterating global reduction 4 with 2 rules applied. Total rules applied 1269 place count 142 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1271 place count 142 transition count 340
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1335 place count 110 transition count 304
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1358 place count 87 transition count 181
Iterating global reduction 5 with 23 rules applied. Total rules applied 1381 place count 87 transition count 181
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1392 place count 87 transition count 170
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1404 place count 75 transition count 154
Iterating global reduction 6 with 12 rules applied. Total rules applied 1416 place count 75 transition count 154
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1428 place count 63 transition count 138
Iterating global reduction 6 with 12 rules applied. Total rules applied 1440 place count 63 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1444 place count 63 transition count 134
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 7 with 16 rules applied. Total rules applied 1460 place count 55 transition count 141
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1461 place count 54 transition count 133
Iterating global reduction 7 with 1 rules applied. Total rules applied 1462 place count 54 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1463 place count 54 transition count 132
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1467 place count 54 transition count 128
Applied a total of 1467 rules in 44 ms. Remains 54 /831 variables (removed 777) and now considering 128/1073 (removed 945) transitions.
[2022-06-09 10:54:04] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 54 cols
[2022-06-09 10:54:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:54:04] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-06-09 10:54:04] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 54 cols
[2022-06-09 10:54:04] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 10:54:04] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-09 10:54:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-06-09 10:54:05] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 10:54:05] [INFO ] Flow matrix only has 123 transitions (discarded 5 similar events)
// Phase 1: matrix 123 rows 54 cols
[2022-06-09 10:54:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:54:05] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/831 places, 128/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/831 places, 128/1073 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 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 s32 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 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X((p0 U p1))))) U (G(!p0) U p2)))'
Support contains 3 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 804 transition count 1045
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 804 transition count 1045
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 804 transition count 1044
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 799 transition count 1039
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 799 transition count 1039
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 799 transition count 1037
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 796 transition count 1034
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 796 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 794 transition count 1032
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 793 transition count 1031
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 792 transition count 1030
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 792 transition count 1029
Applied a total of 83 rules in 244 ms. Remains 792 /831 variables (removed 39) and now considering 1029/1073 (removed 44) transitions.
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:54:05] [INFO ] Computed 5 place invariants in 13 ms
[2022-06-09 10:54:05] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:54:05] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:54:06] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
// Phase 1: matrix 1029 rows 792 cols
[2022-06-09 10:54:06] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:54:07] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 792/831 places, 1029/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 792/831 places, 1029/1073 transitions.
Stuttering acceptance computed with spot in 596 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), p0, (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=p0, acceptance={} source=9 dest: 5}, { cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 14}], [{ cond=p0, acceptance={} source=13 dest: 6}, { cond=(NOT p0), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p2:(EQ s204 1), p0:(NEQ s505 1), p1:(EQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-11 finished in 3261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(((p0 U p1) U !X((F(p0)||G(p2)))))))))'
Support contains 3 out of 831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Graph (trivial) has 827 edges and 831 vertex of which 61 / 831 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 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 780 transition count 440
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 589 rules applied. Total rules applied 1166 place count 204 transition count 427
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 1173 place count 199 transition count 425
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1177 place count 197 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1178 place count 196 transition count 423
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 1178 place count 196 transition count 381
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1262 place count 154 transition count 381
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1268 place count 148 transition count 375
Iterating global reduction 5 with 6 rules applied. Total rules applied 1274 place count 148 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1274 place count 148 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1276 place count 147 transition count 374
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1278 place count 145 transition count 346
Iterating global reduction 5 with 2 rules applied. Total rules applied 1280 place count 145 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1282 place count 145 transition count 344
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1346 place count 113 transition count 308
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1368 place count 91 transition count 187
Iterating global reduction 6 with 22 rules applied. Total rules applied 1390 place count 91 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1400 place count 91 transition count 177
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1411 place count 80 transition count 163
Iterating global reduction 7 with 11 rules applied. Total rules applied 1422 place count 80 transition count 163
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1433 place count 69 transition count 149
Iterating global reduction 7 with 11 rules applied. Total rules applied 1444 place count 69 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1448 place count 69 transition count 145
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1466 place count 60 transition count 152
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1467 place count 59 transition count 142
Iterating global reduction 8 with 1 rules applied. Total rules applied 1468 place count 59 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1469 place count 59 transition count 141
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1474 place count 59 transition count 136
Applied a total of 1474 rules in 83 ms. Remains 59 /831 variables (removed 772) and now considering 136/1073 (removed 937) transitions.
[2022-06-09 10:54:08] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 59 cols
[2022-06-09 10:54:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:54:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-09 10:54:08] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 59 cols
[2022-06-09 10:54:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:54:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-09 10:54:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-06-09 10:54:08] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 10:54:08] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 59 cols
[2022-06-09 10:54:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:54:09] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/831 places, 136/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/831 places, 136/1073 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR p0 p2), (OR p0 p2), false, (OR p0 p2), p0, p2, p0, (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=p0, acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=p0, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=p0, acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=p2, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=p0, acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 1}]], initial=0, aps=[p1:(EQ s50 1), p0:(EQ s22 1), p2:(EQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 19802 steps with 2773 reset in 74 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-12 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p2)&&p1)||p0))||F(X(p3))))'
Support contains 9 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 805 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 801 transition count 1041
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 801 transition count 1041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 801 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 799 transition count 1037
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 799 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 798 transition count 1036
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 798 transition count 1036
Applied a total of 70 rules in 266 ms. Remains 798 /831 variables (removed 33) and now considering 1036/1073 (removed 37) transitions.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:09] [INFO ] Computed 5 place invariants in 10 ms
[2022-06-09 10:54:10] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:10] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-09 10:54:11] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:11] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-09 10:54:12] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 798/831 places, 1036/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 798/831 places, 1036/1073 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s214 0) (EQ s415 0) (EQ s608 0)), p1:(AND (EQ s42 1) (EQ s235 1) (EQ s436 1) (EQ s629 1)), p2:(OR (EQ s21 0) (EQ s214 0) (EQ s415 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1276 reset in 337 ms.
Product exploration explored 100000 steps with 1282 reset in 300 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 (NOT p1) p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 439212 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{1=1, 2=1, 4=1}
Probabilistic random walk after 439212 steps, saw 86455 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:17] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:54:17] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2022-06-09 10:54:17] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 10:54:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2022-06-09 10:54:18] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-09 10:54:18] [INFO ] Deduced a trap composed of 299 places in 330 ms of which 1 ms to minimize.
[2022-06-09 10:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2022-06-09 10:54:18] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-09 10:54:19] [INFO ] After 1221ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 798/798 places, 1036/1036 transitions.
Graph (trivial) has 796 edges and 798 vertex of which 68 / 798 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 1191 edges and 742 vertex of which 738 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 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 562 rules applied. Total rules applied 564 place count 738 transition count 398
Reduce places removed 558 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 570 rules applied. Total rules applied 1134 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1138 place count 176 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 1138 place count 176 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 1228 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1229 place count 131 transition count 340
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 1289 place count 101 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1297 place count 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1322 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1347 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1360 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1372 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1384 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1392 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1400 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1404 place count 56 transition count 111
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 1412 place count 52 transition count 107
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 1420 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1442 place count 48 transition count 99
Reduce places removed 22 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 40 rules applied. Total rules applied 1482 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1486 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1490 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1491 place count 22 transition count 76
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1517 place count 22 transition count 50
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 1521 place count 20 transition count 68
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1529 place count 20 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1531 place count 20 transition count 60
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1533 place count 20 transition count 58
Applied a total of 1533 rules in 68 ms. Remains 20 /798 variables (removed 778) and now considering 58/1036 (removed 978) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/798 places, 58/1036 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (G (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (F p3), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 12 factoid took 627 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Support contains 9 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 1036/1036 transitions.
Applied a total of 0 rules in 24 ms. Remains 798 /798 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:20] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:54:20] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:20] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:54:21] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:21] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:54:22] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 798/798 places, 1036/1036 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 p3) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 762910 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 762910 steps, saw 143654 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1036 rows 798 cols
[2022-06-09 10:54:25] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:54:26] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2022-06-09 10:54:26] [INFO ] After 587ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:54:27] [INFO ] Deduced a trap composed of 299 places in 495 ms of which 1 ms to minimize.
[2022-06-09 10:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 639 ms
[2022-06-09 10:54:27] [INFO ] After 1271ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:54:27] [INFO ] After 1435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:54:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-06-09 10:54:28] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:54:28] [INFO ] Deduced a trap composed of 299 places in 453 ms of which 1 ms to minimize.
[2022-06-09 10:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2022-06-09 10:54:28] [INFO ] After 1100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-09 10:54:28] [INFO ] After 1301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 798/798 places, 1036/1036 transitions.
Graph (trivial) has 796 edges and 798 vertex of which 68 / 798 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 1191 edges and 742 vertex of which 738 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 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 562 rules applied. Total rules applied 564 place count 738 transition count 398
Reduce places removed 558 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 570 rules applied. Total rules applied 1134 place count 180 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1138 place count 176 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 1138 place count 176 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 1228 place count 131 transition count 341
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1229 place count 131 transition count 340
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 1289 place count 101 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1297 place count 101 transition count 302
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1322 place count 76 transition count 148
Iterating global reduction 5 with 25 rules applied. Total rules applied 1347 place count 76 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1360 place count 76 transition count 135
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1372 place count 64 transition count 123
Iterating global reduction 6 with 12 rules applied. Total rules applied 1384 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1392 place count 56 transition count 115
Iterating global reduction 6 with 8 rules applied. Total rules applied 1400 place count 56 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1404 place count 56 transition count 111
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 1412 place count 52 transition count 107
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 1420 place count 48 transition count 128
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1442 place count 48 transition count 99
Reduce places removed 22 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 40 rules applied. Total rules applied 1482 place count 26 transition count 81
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1486 place count 22 transition count 77
Iterating global reduction 8 with 4 rules applied. Total rules applied 1490 place count 22 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1491 place count 22 transition count 76
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1517 place count 22 transition count 50
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 1521 place count 20 transition count 68
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1529 place count 20 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1531 place count 20 transition count 60
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1533 place count 20 transition count 58
Applied a total of 1533 rules in 44 ms. Remains 20 /798 variables (removed 778) and now considering 58/1036 (removed 978) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/798 places, 58/1036 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))]
False Knowledge obtained : [(F p3), (F (NOT (OR (AND p1 (NOT p3)) (AND (NOT p3) p0)))), (F (AND (NOT p1) (NOT p3) (NOT p0)))]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1297 reset in 191 ms.
Product exploration explored 100000 steps with 1292 reset in 204 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p3), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Support contains 9 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 1036/1036 transitions.
Graph (trivial) has 788 edges and 798 vertex of which 68 / 798 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 542 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 542 rules applied. Total rules applied 543 place count 742 transition count 972
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 551 place count 742 transition count 964
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 551 place count 742 transition count 968
Deduced a syphon composed of 574 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 583 place count 742 transition count 968
Discarding 486 places :
Symmetric choice reduction at 2 with 486 rule applications. Total rules 1069 place count 256 transition count 482
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 486 rules applied. Total rules applied 1555 place count 256 transition count 482
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 1601 place count 256 transition count 495
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1671 place count 186 transition count 353
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1741 place count 186 transition count 353
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1754 place count 186 transition count 340
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1783 place count 157 transition count 307
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1812 place count 157 transition count 307
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1824 place count 145 transition count 295
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1836 place count 145 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1840 place count 145 transition count 291
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1848 place count 137 transition count 283
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1856 place count 137 transition count 283
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1863 place count 137 transition count 318
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1874 place count 126 transition count 296
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1885 place count 126 transition count 296
Deduced a syphon composed of 59 places in 1 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1893 place count 126 transition count 288
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 1893 rules in 93 ms. Remains 126 /798 variables (removed 672) and now considering 288/1036 (removed 748) transitions.
[2022-06-09 10:54:30] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-09 10:54:30] [INFO ] Flow matrix only has 283 transitions (discarded 5 similar events)
// Phase 1: matrix 283 rows 126 cols
[2022-06-09 10:54:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:54:30] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/798 places, 288/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/798 places, 288/1036 transitions.
Stuttering criterion allowed to conclude after 17820 steps with 1661 reset in 99 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-13 finished in 20772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1))&&F(G(!p0))))'
Support contains 2 out of 831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Graph (trivial) has 830 edges and 831 vertex of which 70 / 831 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 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 772 transition count 432
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 587 rules applied. Total rules applied 1162 place count 198 transition count 419
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1167 place count 193 transition count 419
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1167 place count 193 transition count 378
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1249 place count 152 transition count 378
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1255 place count 146 transition count 372
Iterating global reduction 3 with 6 rules applied. Total rules applied 1261 place count 146 transition count 372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1261 place count 146 transition count 371
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 1263 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1265 place count 143 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 143 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1269 place count 143 transition count 341
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1333 place count 111 transition count 305
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 1356 place count 88 transition count 182
Iterating global reduction 4 with 23 rules applied. Total rules applied 1379 place count 88 transition count 182
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1390 place count 88 transition count 171
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1402 place count 76 transition count 155
Iterating global reduction 5 with 12 rules applied. Total rules applied 1414 place count 76 transition count 155
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1426 place count 64 transition count 139
Iterating global reduction 5 with 12 rules applied. Total rules applied 1438 place count 64 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1442 place count 64 transition count 135
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1456 place count 57 transition count 136
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1457 place count 56 transition count 128
Iterating global reduction 6 with 1 rules applied. Total rules applied 1458 place count 56 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1459 place count 56 transition count 127
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1463 place count 56 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1464 place count 56 transition count 123
Applied a total of 1464 rules in 52 ms. Remains 56 /831 variables (removed 775) and now considering 123/1073 (removed 950) transitions.
[2022-06-09 10:54:30] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
// Phase 1: matrix 118 rows 56 cols
[2022-06-09 10:54:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:54:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-09 10:54:30] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
// Phase 1: matrix 118 rows 56 cols
[2022-06-09 10:54:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:54:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-09 10:54:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-06-09 10:54:30] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 10:54:30] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
// Phase 1: matrix 118 rows 56 cols
[2022-06-09 10:54:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 10:54:30] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/831 places, 123/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/831 places, 123/1073 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) p0), (NOT p0), (NOT p1), p0]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s53 1), p0:(NEQ s51 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 11 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 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(p1)))))'
Support contains 5 out of 831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 831/831 places, 1073/1073 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 820 transition count 1062
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 820 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 820 transition count 1061
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 811 transition count 1052
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 811 transition count 1052
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 805 transition count 1046
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 805 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 801 transition count 1041
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 801 transition count 1041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 801 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 799 transition count 1037
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 799 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 797 transition count 1035
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 797 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 796 transition count 1034
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 796 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 795 transition count 1033
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 795 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 795 transition count 1032
Applied a total of 77 rules in 240 ms. Remains 795 /831 variables (removed 36) and now considering 1032/1073 (removed 41) transitions.
// Phase 1: matrix 1032 rows 795 cols
[2022-06-09 10:54:31] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-09 10:54:31] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1032 rows 795 cols
[2022-06-09 10:54:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-09 10:54:32] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
// Phase 1: matrix 1032 rows 795 cols
[2022-06-09 10:54:32] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-09 10:54:33] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 795/831 places, 1032/1073 transitions.
Finished structural reductions, in 1 iterations. Remains : 795/831 places, 1032/1073 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s261 1) (EQ s433 1) (EQ s626 1)), p1:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 61 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 2837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((p0 U X(X(!X(!p0))))))))))'
[2022-06-09 10:54:33] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12388518631118510828
[2022-06-09 10:54:33] [INFO ] Computing symmetric may disable matrix : 1073 transitions.
[2022-06-09 10:54:33] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:54:34] [INFO ] Computing symmetric may enable matrix : 1073 transitions.
[2022-06-09 10:54:34] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:54:34] [INFO ] Applying decomposition
[2022-06-09 10:54:34] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3811125358369691003.txt' '-o' '/tmp/graph3811125358369691003.bin' '-w' '/tmp/graph3811125358369691003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3811125358369691003.bin' '-l' '-1' '-v' '-w' '/tmp/graph3811125358369691003.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:54:34] [INFO ] Decomposing Gal with order
[2022-06-09 10:54:34] [INFO ] Computing Do-Not-Accords matrix : 1073 transitions.
[2022-06-09 10:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:54:34] [INFO ] Computation of Completed DNA matrix. took 90 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:54:34] [INFO ] Built C files in 552ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12388518631118510828
Running compilation step : cd /tmp/ltsmin12388518631118510828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 10:54:34] [INFO ] Removed a total of 867 redundant transitions.
[2022-06-09 10:54:34] [INFO ] Flatten gal took : 183 ms
[2022-06-09 10:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-06-09 10:54:34] [INFO ] Time to serialize gal into /tmp/LTLFireability8356931490962814104.gal : 12 ms
[2022-06-09 10:54:34] [INFO ] Time to serialize properties into /tmp/LTLFireability11520874539678216640.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8356931490962814104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11520874539678216640.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(X(("(i7.u61.p166!=1)")U(X(X(!(X("(i7.u61.p166==1)"))))))))))))
Formula 0 simplified : !FGXGX("(i7.u61.p166!=1)" U XX!X"(i7.u61.p166==1)")
Compilation finished in 5058 ms.
Running link step : cd /tmp/ltsmin12388518631118510828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin12388518631118510828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([](X(((LTLAPp0==true) U X(X(!X(!(LTLAPp0==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t32, t163, t164, t220, t254, t343, t344, t400, t434, t470, t526, t585, t618, t715, t716, t717...650
Computing Next relation with stutter on 83938 deadlock states
389 unique states visited
388 strongly connected components in search stack
391 transitions explored
389 items max in DFS search stack
19455 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,194.73,2205036,1,0,2.90558e+06,1208,5093,1.97033e+07,137,5806,3911297
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-03b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 686347 ms.

BK_STOP 1654772556745

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r294-smll-165463872400116"
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 ;