About the Execution of LoLa+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1158.067 | 318832.00 | 401385.00 | 1419.00 | FT?TFTFFFFTF?FFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853500740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FunctionPointer-PT-c016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500740
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 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 FunctionPointer-PT-c016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678517395856
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:49:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:49:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:49:57] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2023-03-11 06:49:57] [INFO ] Transformed 2826 places.
[2023-03-11 06:49:57] [INFO ] Transformed 8960 transitions.
[2023-03-11 06:49:57] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 28 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3732
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3732
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 1 with 388 rules applied. Total rules applied 997 place count 1315 transition count 3344
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1149 place count 1163 transition count 3040
Iterating global reduction 2 with 152 rules applied. Total rules applied 1301 place count 1163 transition count 3040
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 1381 place count 1163 transition count 2960
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1395 place count 1149 transition count 2932
Iterating global reduction 3 with 14 rules applied. Total rules applied 1409 place count 1149 transition count 2932
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1423 place count 1135 transition count 2904
Iterating global reduction 3 with 14 rules applied. Total rules applied 1437 place count 1135 transition count 2904
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1451 place count 1121 transition count 2876
Iterating global reduction 3 with 14 rules applied. Total rules applied 1465 place count 1121 transition count 2876
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1479 place count 1107 transition count 2848
Iterating global reduction 3 with 14 rules applied. Total rules applied 1493 place count 1107 transition count 2848
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1507 place count 1093 transition count 2820
Iterating global reduction 3 with 14 rules applied. Total rules applied 1521 place count 1093 transition count 2820
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1534 place count 1080 transition count 2794
Iterating global reduction 3 with 13 rules applied. Total rules applied 1547 place count 1080 transition count 2794
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1560 place count 1067 transition count 2768
Iterating global reduction 3 with 13 rules applied. Total rules applied 1573 place count 1067 transition count 2768
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 1623 place count 1017 transition count 2582
Iterating global reduction 3 with 50 rules applied. Total rules applied 1673 place count 1017 transition count 2582
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1729 place count 961 transition count 2358
Iterating global reduction 3 with 56 rules applied. Total rules applied 1785 place count 961 transition count 2358
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1841 place count 905 transition count 2220
Iterating global reduction 3 with 56 rules applied. Total rules applied 1897 place count 905 transition count 2220
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1951 place count 851 transition count 2112
Iterating global reduction 3 with 54 rules applied. Total rules applied 2005 place count 851 transition count 2112
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2059 place count 797 transition count 2004
Iterating global reduction 3 with 54 rules applied. Total rules applied 2113 place count 797 transition count 2004
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2167 place count 743 transition count 1896
Iterating global reduction 3 with 54 rules applied. Total rules applied 2221 place count 743 transition count 1896
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2275 place count 689 transition count 1788
Iterating global reduction 3 with 54 rules applied. Total rules applied 2329 place count 689 transition count 1788
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2341 place count 677 transition count 1764
Iterating global reduction 3 with 12 rules applied. Total rules applied 2353 place count 677 transition count 1764
Applied a total of 2353 rules in 1437 ms. Remains 677 /1628 variables (removed 951) and now considering 1764/5962 (removed 4198) transitions.
[2023-03-11 06:49:59] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
// Phase 1: matrix 1183 rows 677 cols
[2023-03-11 06:49:59] [INFO ] Computed 2 place invariants in 31 ms
[2023-03-11 06:50:00] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-11 06:50:00] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-11 06:50:00] [INFO ] Invariant cache hit.
[2023-03-11 06:50:00] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 06:50:01] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2023-03-11 06:50:01] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-11 06:50:01] [INFO ] Invariant cache hit.
[2023-03-11 06:50:02] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 677/1628 places, 1764/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 677/1628 places, 1764/5962 transitions.
Support contains 20 out of 677 places after structural reductions.
[2023-03-11 06:50:02] [INFO ] Flatten gal took : 126 ms
[2023-03-11 06:50:02] [INFO ] Flatten gal took : 95 ms
[2023-03-11 06:50:02] [INFO ] Input system was already deterministic with 1764 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 06:50:03] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-11 06:50:03] [INFO ] Invariant cache hit.
[2023-03-11 06:50:03] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:50:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:05] [INFO ] After 1882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 06:50:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:07] [INFO ] After 1609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 06:50:07] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 06:50:08] [INFO ] After 1421ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 06:50:09] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 5 ms to minimize.
[2023-03-11 06:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-11 06:50:10] [INFO ] After 2990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1093 ms.
[2023-03-11 06:50:11] [INFO ] After 6126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 80 ms.
Support contains 16 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 677 transition count 1748
Applied a total of 16 rules in 323 ms. Remains 677 /677 variables (removed 0) and now considering 1748/1764 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 677/677 places, 1748/1764 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 06:50:12] [INFO ] Flow matrix only has 1175 transitions (discarded 573 similar events)
// Phase 1: matrix 1175 rows 677 cols
[2023-03-11 06:50:12] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 06:50:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:13] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 06:50:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:15] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:15] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 06:50:15] [INFO ] After 934ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:16] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 0 ms to minimize.
[2023-03-11 06:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-11 06:50:17] [INFO ] After 2050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 675 ms.
[2023-03-11 06:50:17] [INFO ] After 4188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 65 ms.
Support contains 13 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1748/1748 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 676 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 676 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 675 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 675 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 674 transition count 1740
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 674 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 673 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 673 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 672 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 672 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 671 transition count 1734
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 671 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 670 transition count 1732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 670 transition count 1732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 669 transition count 1730
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 669 transition count 1730
Applied a total of 16 rules in 225 ms. Remains 669 /677 variables (removed 8) and now considering 1730/1748 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 669/677 places, 1730/1748 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 148823 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148823 steps, saw 96617 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-11 06:50:21] [INFO ] Flow matrix only has 1162 transitions (discarded 568 similar events)
// Phase 1: matrix 1162 rows 669 cols
[2023-03-11 06:50:21] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-11 06:50:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:22] [INFO ] After 1324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 06:50:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:24] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:24] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-11 06:50:25] [INFO ] After 1034ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:25] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 0 ms to minimize.
[2023-03-11 06:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-11 06:50:26] [INFO ] After 2174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-11 06:50:27] [INFO ] After 4295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 70 ms.
Support contains 13 out of 669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 669/669 places, 1730/1730 transitions.
Applied a total of 0 rules in 97 ms. Remains 669 /669 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 669/669 places, 1730/1730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 669/669 places, 1730/1730 transitions.
Applied a total of 0 rules in 88 ms. Remains 669 /669 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
[2023-03-11 06:50:27] [INFO ] Flow matrix only has 1162 transitions (discarded 568 similar events)
[2023-03-11 06:50:27] [INFO ] Invariant cache hit.
[2023-03-11 06:50:27] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-11 06:50:27] [INFO ] Flow matrix only has 1162 transitions (discarded 568 similar events)
[2023-03-11 06:50:27] [INFO ] Invariant cache hit.
[2023-03-11 06:50:27] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-11 06:50:29] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-11 06:50:29] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-11 06:50:29] [INFO ] Flow matrix only has 1162 transitions (discarded 568 similar events)
[2023-03-11 06:50:29] [INFO ] Invariant cache hit.
[2023-03-11 06:50:30] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2877 ms. Remains : 669/669 places, 1730/1730 transitions.
Graph (trivial) has 1013 edges and 669 vertex of which 189 / 669 are part of one of the 63 SCC in 4 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 757 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 543 transition count 960
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 530 transition count 960
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 27 place count 530 transition count 871
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 205 place count 441 transition count 871
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 267 place count 379 transition count 809
Iterating global reduction 2 with 62 rules applied. Total rules applied 329 place count 379 transition count 809
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 453 place count 379 transition count 685
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 721 place count 245 transition count 551
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 785 place count 181 transition count 423
Iterating global reduction 3 with 64 rules applied. Total rules applied 849 place count 181 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 850 place count 181 transition count 422
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 913 place count 118 transition count 296
Iterating global reduction 4 with 63 rules applied. Total rules applied 976 place count 118 transition count 296
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1039 place count 55 transition count 170
Iterating global reduction 4 with 63 rules applied. Total rules applied 1102 place count 55 transition count 170
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1165 place count 55 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1165 place count 55 transition count 106
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 1167 place count 54 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1169 place count 53 transition count 105
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1179 place count 48 transition count 105
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 1187 place count 48 transition count 97
Applied a total of 1187 rules in 65 ms. Remains 48 /669 variables (removed 621) and now considering 97/1730 (removed 1633) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 97 rows 48 cols
[2023-03-11 06:50:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:50:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:50:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:30] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2023-03-11 06:50:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:50:30] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 06:50:30] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 06:50:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:50:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:30] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:30] [INFO ] After 45ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-11 06:50:30] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 06:50:30] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 159 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-11 06:50:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:50:30] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 06:50:31] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-11 06:50:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:31] [INFO ] Invariant cache hit.
[2023-03-11 06:50:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:32] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2023-03-11 06:50:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:32] [INFO ] Invariant cache hit.
[2023-03-11 06:50:33] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2677 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 577 ms.
Product exploration explored 100000 steps with 0 reset in 621 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 218692 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218692 steps, saw 141962 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:50:38] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:38] [INFO ] Invariant cache hit.
[2023-03-11 06:50:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:39] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-11 06:50:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:39] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 06:50:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:40] [INFO ] After 297ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 06:50:40] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-11 06:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-11 06:50:40] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-11 06:50:40] [INFO ] After 1502ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 152 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 203452 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203452 steps, saw 132071 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:50:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:50:43] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:50:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:50:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:44] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:50:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:50:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:45] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:50:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:45] [INFO ] After 318ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:50:45] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-11 06:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-11 06:50:46] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-11 06:50:46] [INFO ] After 1592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 112 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 130 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:50:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:50:46] [INFO ] Invariant cache hit.
[2023-03-11 06:50:46] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-11 06:50:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:50:46] [INFO ] Invariant cache hit.
[2023-03-11 06:50:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:48] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-03-11 06:50:48] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 06:50:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:50:48] [INFO ] Invariant cache hit.
[2023-03-11 06:50:49] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2757 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 2 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 20 transition count 34
Applied a total of 1123 rules in 36 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-11 06:50:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:50:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:50:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:49] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 06:50:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:50:49] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:50:49] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:50:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:50:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:50:49] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:50:49] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:50:49] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 06:50:49] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 22 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:50:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:50:49] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:50:50] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-11 06:50:50] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:50] [INFO ] Invariant cache hit.
[2023-03-11 06:50:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:51] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-11 06:50:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:51] [INFO ] Invariant cache hit.
[2023-03-11 06:50:52] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2498 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 330574 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330574 steps, saw 214573 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:50:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:50:55] [INFO ] Invariant cache hit.
[2023-03-11 06:50:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:50:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:56] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:50:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:50:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:50:56] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:50:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:50:57] [INFO ] After 196ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:50:57] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-11 06:50:57] [INFO ] After 1085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 195 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 324101 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 324101 steps, saw 210373 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:51:00] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:51:00] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:51:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:51:01] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:51:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:51:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:51:01] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:51:01] [INFO ] After 203ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:02] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-11 06:51:02] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 86 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:51:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:51:02] [INFO ] Invariant cache hit.
[2023-03-11 06:51:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-11 06:51:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:51:03] [INFO ] Invariant cache hit.
[2023-03-11 06:51:03] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:51:04] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2023-03-11 06:51:04] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-11 06:51:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:51:04] [INFO ] Invariant cache hit.
[2023-03-11 06:51:05] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2841 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 20 transition count 34
Applied a total of 1123 rules in 30 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-11 06:51:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:51:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:51:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:51:05] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 06:51:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:51:05] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:51:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:51:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:51:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:51:05] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:05] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:05] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 06:51:05] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 590 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 13 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:51:07] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:51:07] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:51:07] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-11 06:51:07] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:51:07] [INFO ] Invariant cache hit.
[2023-03-11 06:51:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:51:09] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2023-03-11 06:51:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:51:09] [INFO ] Invariant cache hit.
[2023-03-11 06:51:09] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2419 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 39158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(!p0)))) U (p1||X(!p2))))'
Support contains 5 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 669 transition count 1748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 669 transition count 1748
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 669 transition count 1742
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 661 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 654 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 647 transition count 1676
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 647 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 641 transition count 1662
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 641 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 635 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 635 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 629 transition count 1638
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 629 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 623 transition count 1626
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 619 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 618 transition count 1616
Applied a total of 124 rules in 144 ms. Remains 618 /677 variables (removed 59) and now considering 1616/1764 (removed 148) transitions.
[2023-03-11 06:51:10] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2023-03-11 06:51:10] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-11 06:51:10] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-11 06:51:10] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-11 06:51:10] [INFO ] Invariant cache hit.
[2023-03-11 06:51:10] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 06:51:12] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2023-03-11 06:51:12] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-11 06:51:12] [INFO ] Invariant cache hit.
[2023-03-11 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/677 places, 1616/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3057 ms. Remains : 618/677 places, 1616/1764 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, p0]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s529 1)), p2:(AND (GEQ s1 1) (GEQ s546 1)), p0:(AND (GEQ s1 1) (GEQ s296 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 865 ms.
Product exploration explored 100000 steps with 50000 reset in 793 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-03 finished in 5174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(p0)&&p1))))'
Support contains 4 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 1742
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 657 transition count 1714
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 657 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 648 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 648 transition count 1684
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 639 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 639 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 632 transition count 1640
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 632 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 625 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 625 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 618 transition count 1612
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 618 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 611 transition count 1598
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 606 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 605 transition count 1586
Applied a total of 148 rules in 130 ms. Remains 605 /677 variables (removed 72) and now considering 1586/1764 (removed 178) transitions.
[2023-03-11 06:51:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-11 06:51:15] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:51:15] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-11 06:51:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 06:51:15] [INFO ] Invariant cache hit.
[2023-03-11 06:51:15] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 06:51:16] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2023-03-11 06:51:16] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 06:51:16] [INFO ] Invariant cache hit.
[2023-03-11 06:51:17] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/677 places, 1586/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2318 ms. Remains : 605/677 places, 1586/1764 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s151 1)), p1:(AND (GEQ s0 1) (GEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 2438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 614 transition count 1608
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 613 transition count 1606
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 136 place count 613 transition count 1602
Applied a total of 136 rules in 402 ms. Remains 613 /677 variables (removed 64) and now considering 1602/1764 (removed 162) transitions.
[2023-03-11 06:51:17] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-11 06:51:17] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:51:18] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-11 06:51:18] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-11 06:51:18] [INFO ] Invariant cache hit.
[2023-03-11 06:51:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:51:20] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2023-03-11 06:51:20] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 06:51:20] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-11 06:51:20] [INFO ] Invariant cache hit.
[2023-03-11 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/677 places, 1602/1764 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3204 ms. Remains : 613/677 places, 1602/1764 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s533 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 80 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 3264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 650 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 650 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 641 transition count 1662
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 641 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 634 transition count 1646
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 634 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 627 transition count 1632
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 627 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 620 transition count 1618
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 620 transition count 1618
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 613 transition count 1604
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 613 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 608 transition count 1594
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 607 transition count 1592
Applied a total of 142 rules in 134 ms. Remains 607 /677 variables (removed 70) and now considering 1592/1764 (removed 172) transitions.
[2023-03-11 06:51:20] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-11 06:51:20] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 06:51:21] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-11 06:51:21] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:51:21] [INFO ] Invariant cache hit.
[2023-03-11 06:51:21] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:51:23] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2023-03-11 06:51:23] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:51:23] [INFO ] Invariant cache hit.
[2023-03-11 06:51:23] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/677 places, 1592/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2867 ms. Remains : 607/677 places, 1592/1764 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s521 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 74 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 2943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&F(p1)))||X(X((p1 U (p2||G(p1))))))))'
Support contains 5 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 670 transition count 1748
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 670 transition count 1748
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 670 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 663 transition count 1728
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 663 transition count 1728
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 657 transition count 1708
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 657 transition count 1708
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 651 transition count 1688
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 651 transition count 1688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 646 transition count 1676
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 646 transition count 1676
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 641 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 636 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 636 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 631 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 627 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 626 transition count 1636
Applied a total of 106 rules in 132 ms. Remains 626 /677 variables (removed 51) and now considering 1636/1764 (removed 128) transitions.
[2023-03-11 06:51:23] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-11 06:51:23] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 06:51:24] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-11 06:51:24] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:24] [INFO ] Invariant cache hit.
[2023-03-11 06:51:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:51:25] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2023-03-11 06:51:25] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:25] [INFO ] Invariant cache hit.
[2023-03-11 06:51:26] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/677 places, 1636/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2677 ms. Remains : 626/677 places, 1636/1764 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s544 1)), p1:(OR (LT s4 1) (LT s531 1)), p2:(AND (OR (LT s4 1) (LT s531 1)) (NOT (AND (GEQ s1 1) (GEQ s547 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 629 ms.
Product exploration explored 100000 steps with 25000 reset in 618 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 152982 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152982 steps, saw 99314 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-11 06:51:31] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:31] [INFO ] Invariant cache hit.
[2023-03-11 06:51:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:51:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:51:32] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-11 06:51:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:51:33] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 06:51:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:51:34] [INFO ] After 1008ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-11 06:51:34] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-11 06:51:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-11 06:51:35] [INFO ] After 2055ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-11 06:51:36] [INFO ] After 3785ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Graph (complete) has 2726 edges and 626 vertex of which 434 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 434 transition count 1252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 434 transition count 1246
Applied a total of 391 rules in 102 ms. Remains 434 /626 variables (removed 192) and now considering 1246/1636 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 06:51:36] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-11 06:51:36] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-11 06:51:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:36] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:51:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-11 06:51:37] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 06:51:37] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:51:37] [INFO ] After 407ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 06:51:38] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-11 06:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-11 06:51:38] [INFO ] After 1089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 388 ms.
[2023-03-11 06:51:38] [INFO ] After 2302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 49 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:51:39] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:39] [INFO ] Invariant cache hit.
[2023-03-11 06:51:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:39] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:51:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:39] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:39] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:51:40] [INFO ] After 280ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:40] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-11 06:51:40] [INFO ] After 1378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 54 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 230215 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230215 steps, saw 141179 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:51:44] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:44] [INFO ] Invariant cache hit.
[2023-03-11 06:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:44] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-11 06:51:44] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:44] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:51:45] [INFO ] After 297ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:45] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-11 06:51:45] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 43 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 434/434 places, 1246/1246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 44 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2023-03-11 06:51:45] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:45] [INFO ] Invariant cache hit.
[2023-03-11 06:51:45] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-11 06:51:45] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:45] [INFO ] Invariant cache hit.
[2023-03-11 06:51:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:51:46] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-11 06:51:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 06:51:46] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:46] [INFO ] Invariant cache hit.
[2023-03-11 06:51:47] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1653 ms. Remains : 434/434 places, 1246/1246 transitions.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 434 transition count 698
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 559 place count 423 transition count 698
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 559 place count 423 transition count 622
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 711 place count 347 transition count 622
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 969 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1033 place count 154 transition count 365
Iterating global reduction 2 with 64 rules applied. Total rules applied 1097 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1161 place count 91 transition count 238
Iterating global reduction 3 with 63 rules applied. Total rules applied 1224 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1287 place count 28 transition count 112
Iterating global reduction 3 with 63 rules applied. Total rules applied 1350 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1413 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1413 place count 28 transition count 48
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 1415 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1417 place count 26 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1419 place count 25 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1420 place count 25 transition count 46
Applied a total of 1420 rules in 25 ms. Remains 25 /434 variables (removed 409) and now considering 46/1246 (removed 1200) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 46 rows 25 cols
[2023-03-11 06:51:47] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 06:51:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 06:51:47] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:51:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 06:51:47] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:51:47] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:51:47] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 06:51:47] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Applied a total of 0 rules in 15 ms. Remains 626 /626 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2023-03-11 06:51:48] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-11 06:51:48] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 06:51:48] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-11 06:51:48] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:48] [INFO ] Invariant cache hit.
[2023-03-11 06:51:49] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:51:50] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2023-03-11 06:51:50] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:50] [INFO ] Invariant cache hit.
[2023-03-11 06:51:50] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2437 ms. Remains : 626/626 places, 1636/1636 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p2 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 06:51:51] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:51:51] [INFO ] Invariant cache hit.
[2023-03-11 06:51:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:51:51] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 06:51:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:51:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:51:52] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 06:51:52] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:51:53] [INFO ] After 698ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 06:51:53] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-11 06:51:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-11 06:51:54] [INFO ] After 1498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 533 ms.
[2023-03-11 06:51:54] [INFO ] After 2931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Graph (complete) has 2726 edges and 626 vertex of which 434 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 434 transition count 1252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 434 transition count 1246
Applied a total of 391 rules in 100 ms. Remains 434 /626 variables (removed 192) and now considering 1246/1636 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:51:55] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-11 06:51:55] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-11 06:51:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:55] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:51:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:55] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:51:55] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:51:55] [INFO ] After 243ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:51:56] [INFO ] After 498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-11 06:51:56] [INFO ] After 1104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 48 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 220387 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220387 steps, saw 135154 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:51:59] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:51:59] [INFO ] Invariant cache hit.
[2023-03-11 06:51:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:51:59] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:51:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:00] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:52:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:52:00] [INFO ] After 248ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:52:00] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-11 06:52:00] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 48 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 434/434 places, 1246/1246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 47 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2023-03-11 06:52:00] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:52:00] [INFO ] Invariant cache hit.
[2023-03-11 06:52:01] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-11 06:52:01] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:52:01] [INFO ] Invariant cache hit.
[2023-03-11 06:52:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-11 06:52:02] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-11 06:52:02] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 06:52:02] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-11 06:52:02] [INFO ] Invariant cache hit.
[2023-03-11 06:52:02] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1716 ms. Remains : 434/434 places, 1246/1246 transitions.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 434 transition count 698
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 559 place count 423 transition count 698
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 559 place count 423 transition count 622
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 711 place count 347 transition count 622
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 969 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1033 place count 154 transition count 365
Iterating global reduction 2 with 64 rules applied. Total rules applied 1097 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1161 place count 91 transition count 238
Iterating global reduction 3 with 63 rules applied. Total rules applied 1224 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1287 place count 28 transition count 112
Iterating global reduction 3 with 63 rules applied. Total rules applied 1350 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1413 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1413 place count 28 transition count 48
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 1415 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1417 place count 26 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1419 place count 25 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1420 place count 25 transition count 46
Applied a total of 1420 rules in 19 ms. Remains 25 /434 variables (removed 409) and now considering 46/1246 (removed 1200) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 46 rows 25 cols
[2023-03-11 06:52:02] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 06:52:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:52:02] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:52:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 06:52:02] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:52:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:52:02] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:52:02] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 06:52:02] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 600 ms.
Product exploration explored 100000 steps with 25000 reset in 607 ms.
Applying partial POR strategy [false, false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1630
Applied a total of 6 rules in 191 ms. Remains 626 /626 variables (removed 0) and now considering 1630/1636 (removed 6) transitions.
[2023-03-11 06:52:05] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 06:52:05] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
// Phase 1: matrix 1091 rows 626 cols
[2023-03-11 06:52:05] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 06:52:06] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 626/626 places, 1630/1636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 788 ms. Remains : 626/626 places, 1630/1636 transitions.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Applied a total of 0 rules in 12 ms. Remains 626 /626 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2023-03-11 06:52:06] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-11 06:52:06] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 06:52:06] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-11 06:52:06] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:52:06] [INFO ] Invariant cache hit.
[2023-03-11 06:52:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 06:52:08] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2023-03-11 06:52:08] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-11 06:52:08] [INFO ] Invariant cache hit.
[2023-03-11 06:52:09] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2955 ms. Remains : 626/626 places, 1636/1636 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 45681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 637 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 637 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 631 transition count 1644
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 631 transition count 1644
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 625 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 625 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 619 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 619 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 615 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 615 transition count 1612
Applied a total of 126 rules in 121 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-11 06:52:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:52:09] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:52:09] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-11 06:52:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:09] [INFO ] Invariant cache hit.
[2023-03-11 06:52:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:12] [INFO ] Implicit Places using invariants and state equation in 2381 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-03-11 06:52:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:12] [INFO ] Invariant cache hit.
[2023-03-11 06:52:12] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/677 places, 1612/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3392 ms. Remains : 615/677 places, 1612/1764 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33297 reset in 656 ms.
Product exploration explored 100000 steps with 33270 reset in 663 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275697 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275697 steps, saw 178959 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:52:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:17] [INFO ] Invariant cache hit.
[2023-03-11 06:52:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:52:18] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:18] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:19] [INFO ] After 410ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:19] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 0 ms to minimize.
[2023-03-11 06:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-11 06:52:19] [INFO ] After 1013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-11 06:52:20] [INFO ] After 1996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 160 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 286935 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286935 steps, saw 186251 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:52:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-11 06:52:23] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:52:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:52:24] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:24] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:25] [INFO ] After 407ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:25] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2023-03-11 06:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-11 06:52:25] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-11 06:52:25] [INFO ] After 1777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 86 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:52:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:26] [INFO ] Invariant cache hit.
[2023-03-11 06:52:26] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 06:52:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:26] [INFO ] Invariant cache hit.
[2023-03-11 06:52:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:27] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2023-03-11 06:52:27] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 06:52:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:27] [INFO ] Invariant cache hit.
[2023-03-11 06:52:28] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2400 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 33 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-11 06:52:28] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:52:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:52:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:28] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 06:52:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:52:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:28] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:52:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:28] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:28] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:28] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:52:28] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 16 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-11 06:52:29] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:52:29] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:52:29] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-11 06:52:29] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:29] [INFO ] Invariant cache hit.
[2023-03-11 06:52:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:30] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2023-03-11 06:52:30] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:30] [INFO ] Invariant cache hit.
[2023-03-11 06:52:31] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2395 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 301706 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301706 steps, saw 195837 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:52:34] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:34] [INFO ] Invariant cache hit.
[2023-03-11 06:52:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:52:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:35] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:52:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:52:36] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:36] [INFO ] After 399ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:36] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 0 ms to minimize.
[2023-03-11 06:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-11 06:52:37] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-11 06:52:37] [INFO ] After 1936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 146 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 287264 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287264 steps, saw 186467 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:52:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-11 06:52:40] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:52:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:52:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:41] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:52:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:52:41] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:42] [INFO ] After 395ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:42] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-11 06:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-11 06:52:42] [INFO ] After 888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-11 06:52:42] [INFO ] After 1731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 75 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:52:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:43] [INFO ] Invariant cache hit.
[2023-03-11 06:52:43] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-11 06:52:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:43] [INFO ] Invariant cache hit.
[2023-03-11 06:52:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:44] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
[2023-03-11 06:52:44] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 06:52:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:44] [INFO ] Invariant cache hit.
[2023-03-11 06:52:45] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2427 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 27 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-11 06:52:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 06:52:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:52:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:52:45] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 06:52:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:52:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:52:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:52:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:52:45] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:45] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:52:45] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 06:52:45] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33446 reset in 666 ms.
Product exploration explored 100000 steps with 33416 reset in 667 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 18 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-11 06:52:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:52:47] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 06:52:48] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-11 06:52:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:48] [INFO ] Invariant cache hit.
[2023-03-11 06:52:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:49] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
[2023-03-11 06:52:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:52:49] [INFO ] Invariant cache hit.
[2023-03-11 06:52:50] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2633 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 41029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 1742
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 657 transition count 1714
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 657 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 648 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 648 transition count 1684
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 639 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 639 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 632 transition count 1640
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 632 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 625 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 625 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 618 transition count 1612
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 618 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 611 transition count 1598
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 606 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 605 transition count 1584
Applied a total of 150 rules in 353 ms. Remains 605 /677 variables (removed 72) and now considering 1584/1764 (removed 180) transitions.
[2023-03-11 06:52:50] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-11 06:52:50] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:52:51] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-11 06:52:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-11 06:52:51] [INFO ] Invariant cache hit.
[2023-03-11 06:52:51] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 06:52:52] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-11 06:52:52] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:52:52] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-11 06:52:52] [INFO ] Invariant cache hit.
[2023-03-11 06:52:53] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/677 places, 1584/1764 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3113 ms. Remains : 605/677 places, 1584/1764 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s26 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]]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Stack based approach found an accepted trace after 503 steps with 1 reset with depth 341 and stack size 341 in 5 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-14 finished in 3585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 155 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-11 06:52:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:52:54] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 06:52:54] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-11 06:52:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:54] [INFO ] Invariant cache hit.
[2023-03-11 06:52:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:52:57] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 2976 ms to find 0 implicit places.
[2023-03-11 06:52:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:52:57] [INFO ] Invariant cache hit.
[2023-03-11 06:52:57] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3629 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s191 1)), p0:(OR (LT s1 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 782 ms.
Product exploration explored 100000 steps with 50000 reset in 779 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-15 finished in 5446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLFireability-02
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 193 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-11 06:52:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:52:59] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 06:53:00] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 06:53:00] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:00] [INFO ] Invariant cache hit.
[2023-03-11 06:53:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:01] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
[2023-03-11 06:53:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:01] [INFO ] Invariant cache hit.
[2023-03-11 06:53:02] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2654 ms. Remains : 614/677 places, 1608/1764 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 232837 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232837 steps, saw 151142 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:53:06] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:06] [INFO ] Invariant cache hit.
[2023-03-11 06:53:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:07] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-11 06:53:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:07] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 06:53:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:08] [INFO ] After 289ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 06:53:08] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-11 06:53:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-11 06:53:08] [INFO ] After 759ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-11 06:53:08] [INFO ] After 1498ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 142 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275166 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275166 steps, saw 178614 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:53:12] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:53:12] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:53:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:12] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:13] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:13] [INFO ] After 314ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:13] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-11 06:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-11 06:53:13] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-11 06:53:14] [INFO ] After 1481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:53:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:14] [INFO ] Invariant cache hit.
[2023-03-11 06:53:14] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-11 06:53:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:14] [INFO ] Invariant cache hit.
[2023-03-11 06:53:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:16] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2023-03-11 06:53:16] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-11 06:53:16] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:16] [INFO ] Invariant cache hit.
[2023-03-11 06:53:16] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2473 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 20 transition count 34
Applied a total of 1123 rules in 25 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-11 06:53:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:53:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:53:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:53:16] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 06:53:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:53:16] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:16] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:53:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:16] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:16] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:16] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 06:53:16] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 19 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:53:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:53:17] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:53:17] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-11 06:53:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:17] [INFO ] Invariant cache hit.
[2023-03-11 06:53:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:19] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2023-03-11 06:53:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:19] [INFO ] Invariant cache hit.
[2023-03-11 06:53:20] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2774 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 311799 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311799 steps, saw 202389 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:53:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:23] [INFO ] Invariant cache hit.
[2023-03-11 06:53:23] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:53:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:23] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:53:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:53:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:24] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:24] [INFO ] After 196ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:24] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-11 06:53:24] [INFO ] After 1055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 151 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 335666 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335666 steps, saw 217879 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:53:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 06:53:28] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:53:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:28] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:53:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:29] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:29] [INFO ] After 200ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:29] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-11 06:53:29] [INFO ] After 1109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 06:53:29] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:29] [INFO ] Invariant cache hit.
[2023-03-11 06:53:30] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-11 06:53:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:30] [INFO ] Invariant cache hit.
[2023-03-11 06:53:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:31] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-11 06:53:31] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-11 06:53:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 06:53:31] [INFO ] Invariant cache hit.
[2023-03-11 06:53:32] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2541 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 20 transition count 34
Applied a total of 1123 rules in 31 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-11 06:53:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:53:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:53:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:32] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 06:53:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:53:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:53:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:53:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 06:53:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:32] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:32] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:53:32] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 06:53:32] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7 reset in 499 ms.
Product exploration explored 100000 steps with 2 reset in 519 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:53:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-11 06:53:34] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 06:53:34] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-11 06:53:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:34] [INFO ] Invariant cache hit.
[2023-03-11 06:53:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:36] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2023-03-11 06:53:36] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:36] [INFO ] Invariant cache hit.
[2023-03-11 06:53:36] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2373 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 37336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&F(p1)))||X(X((p1 U (p2||G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 637 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 637 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 631 transition count 1644
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 631 transition count 1644
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 625 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 625 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 619 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 619 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 615 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 615 transition count 1612
Applied a total of 126 rules in 162 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-11 06:53:37] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:53:37] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 06:53:37] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-11 06:53:37] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:53:37] [INFO ] Invariant cache hit.
[2023-03-11 06:53:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:39] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2023-03-11 06:53:39] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:53:39] [INFO ] Invariant cache hit.
[2023-03-11 06:53:39] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 615/677 places, 1612/1764 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2804 ms. Remains : 615/677 places, 1612/1764 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33307 reset in 655 ms.
Product exploration explored 100000 steps with 33381 reset in 671 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 259596 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259596 steps, saw 168508 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:53:44] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:53:44] [INFO ] Invariant cache hit.
[2023-03-11 06:53:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:45] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:45] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:46] [INFO ] After 401ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:46] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2023-03-11 06:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-11 06:53:46] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-11 06:53:47] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 146 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 194323 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194323 steps, saw 126145 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:53:50] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-11 06:53:50] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 06:53:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:53:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:51] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:53:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:51] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:52] [INFO ] After 398ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:52] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-11 06:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-11 06:53:52] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-11 06:53:52] [INFO ] After 1738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 86 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 79 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:53:52] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:52] [INFO ] Invariant cache hit.
[2023-03-11 06:53:53] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-11 06:53:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:53] [INFO ] Invariant cache hit.
[2023-03-11 06:53:53] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:54] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2023-03-11 06:53:54] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:53:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:53:54] [INFO ] Invariant cache hit.
[2023-03-11 06:53:55] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2454 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 30 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-11 06:53:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:53:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:53:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:53:55] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 06:53:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:53:55] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:55] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:53:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:53:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:53:55] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:55] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:53:55] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:53:55] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 18 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-11 06:53:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:53:56] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:53:56] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-11 06:53:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:53:56] [INFO ] Invariant cache hit.
[2023-03-11 06:53:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:53:58] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2023-03-11 06:53:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:53:58] [INFO ] Invariant cache hit.
[2023-03-11 06:53:58] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2703 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 212601 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212601 steps, saw 138009 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:54:02] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:54:02] [INFO ] Invariant cache hit.
[2023-03-11 06:54:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:54:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:54:02] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:54:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:54:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:54:03] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:03] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:54:04] [INFO ] After 404ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:04] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 1 ms to minimize.
[2023-03-11 06:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-11 06:54:04] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-11 06:54:04] [INFO ] After 1992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 158 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 276776 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276776 steps, saw 179659 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:54:08] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-11 06:54:08] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:54:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:54:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:54:08] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:54:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:54:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:54:09] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:54:09] [INFO ] After 378ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:09] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-11 06:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-11 06:54:10] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-11 06:54:10] [INFO ] After 1682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 71 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-11 06:54:10] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:54:10] [INFO ] Invariant cache hit.
[2023-03-11 06:54:10] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-11 06:54:10] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:54:10] [INFO ] Invariant cache hit.
[2023-03-11 06:54:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:54:12] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2023-03-11 06:54:12] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 06:54:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:54:12] [INFO ] Invariant cache hit.
[2023-03-11 06:54:12] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2390 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 30 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-11 06:54:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 06:54:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:54:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:54:13] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 06:54:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:54:13] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:54:13] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:54:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 06:54:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:54:13] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:13] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 06:54:13] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:54:13] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33314 reset in 660 ms.
Product exploration explored 100000 steps with 33291 reset in 665 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 16 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-11 06:54:15] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-11 06:54:15] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 06:54:15] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-11 06:54:15] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:54:15] [INFO ] Invariant cache hit.
[2023-03-11 06:54:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:54:17] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2023-03-11 06:54:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-11 06:54:17] [INFO ] Invariant cache hit.
[2023-03-11 06:54:18] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3149 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 41473 ms.
[2023-03-11 06:54:18] [INFO ] Flatten gal took : 64 ms
[2023-03-11 06:54:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 06:54:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 677 places, 1764 transitions and 7182 arcs took 12 ms.
Total runtime 261115 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-c016
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability
FORMULA FunctionPointer-PT-c016-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678517714688
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-c016-LTLFireability-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for FunctionPointer-PT-c016-LTLFireability-10
lola: result : true
lola: markings : 23
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 FunctionPointer-PT-c016-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1800 6/32 FunctionPointer-PT-c016-LTLFireability-12 633091 m, 126618 m/sec, 633091 t fired, .
Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1800 12/32 FunctionPointer-PT-c016-LTLFireability-12 1297117 m, 132805 m/sec, 1297117 t fired, .
Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1800 17/32 FunctionPointer-PT-c016-LTLFireability-12 1959346 m, 132445 m/sec, 1959346 t fired, .
Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1800 23/32 FunctionPointer-PT-c016-LTLFireability-12 2620246 m, 132180 m/sec, 2620245 t fired, .
Time elapsed: 20 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1800 29/32 FunctionPointer-PT-c016-LTLFireability-12 3281413 m, 132233 m/sec, 3281413 t fired, .
Time elapsed: 25 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for FunctionPointer-PT-c016-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-c016-LTLFireability-02
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3570 9/32 FunctionPointer-PT-c016-LTLFireability-02 749051 m, 149810 m/sec, 749050 t fired, .
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3570 16/32 FunctionPointer-PT-c016-LTLFireability-02 1488570 m, 147903 m/sec, 1488570 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3570 24/32 FunctionPointer-PT-c016-LTLFireability-02 2226644 m, 147614 m/sec, 2226644 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3570 32/32 FunctionPointer-PT-c016-LTLFireability-02 2962858 m, 147242 m/sec, 2962858 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-c016-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c016-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLFireability-02: LTL unknown AGGR
FunctionPointer-PT-c016-LTLFireability-10: LTL true LTL model checker
FunctionPointer-PT-c016-LTLFireability-12: LTL unknown AGGR
Time elapsed: 55 secs. Pages in use: 32
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="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-c016, 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 r167-tall-167838853500740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 '
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 ;