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.r165-tall-167838850800732.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 itstools
Input is FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K 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-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679571790884

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 11:43:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 11:43:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:43:13] [INFO ] Load time of PNML (sax parser for PT used): 588 ms
[2023-03-23 11:43:13] [INFO ] Transformed 2826 places.
[2023-03-23 11:43:13] [INFO ] Transformed 8960 transitions.
[2023-03-23 11:43:13] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 796 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 29 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3768
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3768
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 1013 place count 1318 transition count 3358
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 1164 place count 1167 transition count 3056
Iterating global reduction 2 with 151 rules applied. Total rules applied 1315 place count 1167 transition count 3056
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1403 place count 1167 transition count 2968
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1417 place count 1153 transition count 2940
Iterating global reduction 3 with 14 rules applied. Total rules applied 1431 place count 1153 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1444 place count 1140 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1457 place count 1140 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1127 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1127 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1114 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1114 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1101 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1101 transition count 2836
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1546 place count 1090 transition count 2814
Iterating global reduction 3 with 11 rules applied. Total rules applied 1557 place count 1090 transition count 2814
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1568 place count 1079 transition count 2792
Iterating global reduction 3 with 11 rules applied. Total rules applied 1579 place count 1079 transition count 2792
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1618 place count 1040 transition count 2648
Iterating global reduction 3 with 39 rules applied. Total rules applied 1657 place count 1040 transition count 2648
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1706 place count 991 transition count 2452
Iterating global reduction 3 with 49 rules applied. Total rules applied 1755 place count 991 transition count 2452
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1804 place count 942 transition count 2322
Iterating global reduction 3 with 49 rules applied. Total rules applied 1853 place count 942 transition count 2322
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1902 place count 893 transition count 2224
Iterating global reduction 3 with 49 rules applied. Total rules applied 1951 place count 893 transition count 2224
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2000 place count 844 transition count 2126
Iterating global reduction 3 with 49 rules applied. Total rules applied 2049 place count 844 transition count 2126
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2098 place count 795 transition count 2028
Iterating global reduction 3 with 49 rules applied. Total rules applied 2147 place count 795 transition count 2028
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2196 place count 746 transition count 1930
Iterating global reduction 3 with 49 rules applied. Total rules applied 2245 place count 746 transition count 1930
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2260 place count 731 transition count 1900
Iterating global reduction 3 with 15 rules applied. Total rules applied 2275 place count 731 transition count 1900
Applied a total of 2275 rules in 1242 ms. Remains 731 /1628 variables (removed 897) and now considering 1900/5962 (removed 4062) transitions.
[2023-03-23 11:43:14] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
// Phase 1: matrix 1274 rows 731 cols
[2023-03-23 11:43:14] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-23 11:43:15] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-23 11:43:15] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-23 11:43:15] [INFO ] Invariant cache hit.
[2023-03-23 11:43:15] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-23 11:43:17] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
[2023-03-23 11:43:17] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-23 11:43:17] [INFO ] Invariant cache hit.
[2023-03-23 11:43:18] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 731/1628 places, 1900/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4753 ms. Remains : 731/1628 places, 1900/5962 transitions.
Support contains 16 out of 731 places after structural reductions.
[2023-03-23 11:43:18] [INFO ] Flatten gal took : 140 ms
[2023-03-23 11:43:18] [INFO ] Flatten gal took : 95 ms
[2023-03-23 11:43:18] [INFO ] Input system was already deterministic with 1900 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 11:43:19] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-23 11:43:19] [INFO ] Invariant cache hit.
[2023-03-23 11:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:43:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-23 11:43:22] [INFO ] After 2223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:43:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:43:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:43:23] [INFO ] After 1290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 11:43:23] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-23 11:43:24] [INFO ] After 1222ms SMT Verify possible using 307 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 11:43:25] [INFO ] Deduced a trap composed of 131 places in 572 ms of which 4 ms to minimize.
[2023-03-23 11:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2023-03-23 11:43:26] [INFO ] After 2814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-23 11:43:27] [INFO ] After 4998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 35 ms.
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 727 transition count 1892
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 727 transition count 1892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 727 transition count 1890
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 723 transition count 1882
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 723 transition count 1882
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 719 transition count 1870
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 719 transition count 1870
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 714 transition count 1852
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 714 transition count 1852
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 709 transition count 1838
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 709 transition count 1838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 704 transition count 1828
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 704 transition count 1828
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 699 transition count 1818
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 699 transition count 1818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 693 transition count 1802
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 693 transition count 1802
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 687 transition count 1786
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 687 transition count 1786
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 683 transition count 1778
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 683 transition count 1778
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 681 transition count 1774
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 681 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 679 transition count 1770
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 679 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 677 transition count 1766
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 677 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 675 transition count 1762
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 675 transition count 1762
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 132 place count 675 transition count 1744
Applied a total of 132 rules in 587 ms. Remains 675 /731 variables (removed 56) and now considering 1744/1900 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 675/731 places, 1744/1900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 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 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) 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 9) seen :4
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 :1
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 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 11:43:28] [INFO ] Flow matrix only has 1171 transitions (discarded 573 similar events)
// Phase 1: matrix 1171 rows 675 cols
[2023-03-23 11:43:28] [INFO ] Computed 2 place invariants in 33 ms
[2023-03-23 11:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:43:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:43:28] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 11:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:43:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:43:29] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 11:43:29] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-23 11:43:30] [INFO ] After 453ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 11:43:30] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 1 ms to minimize.
[2023-03-23 11:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-23 11:43:30] [INFO ] After 1208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-23 11:43:31] [INFO ] After 2299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1744/1744 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 670 transition count 1730
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 670 transition count 1730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 670 transition count 1726
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 665 transition count 1716
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 665 transition count 1716
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 661 transition count 1706
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 661 transition count 1706
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 657 transition count 1696
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 657 transition count 1696
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 653 transition count 1688
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 653 transition count 1688
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 649 transition count 1680
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 649 transition count 1680
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 645 transition count 1672
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 645 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 643 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 643 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 641 transition count 1664
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 641 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 640 transition count 1662
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 640 transition count 1662
Applied a total of 74 rules in 254 ms. Remains 640 /675 variables (removed 35) and now considering 1662/1744 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 640/675 places, 1662/1744 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 11:43:31] [INFO ] Flow matrix only has 1112 transitions (discarded 550 similar events)
// Phase 1: matrix 1112 rows 640 cols
[2023-03-23 11:43:31] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 11:43:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:43:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 11:43:32] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:43:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:43:33] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:33] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 11:43:33] [INFO ] After 343ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:33] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-23 11:43:34] [INFO ] After 1638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1662/1662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 639 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 639 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 638 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 638 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 637 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 637 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 636 transition count 1652
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 636 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 635 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 635 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 634 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 634 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 633 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 633 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 632 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 632 transition count 1644
Applied a total of 16 rules in 211 ms. Remains 632 /640 variables (removed 8) and now considering 1644/1662 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 632/640 places, 1644/1662 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 243849 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243849 steps, saw 158289 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 11:43:37] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2023-03-23 11:43:37] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 11:43:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:43:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:43:38] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:43:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:43:38] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:38] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:43:39] [INFO ] After 490ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:39] [INFO ] After 825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-23 11:43:39] [INFO ] After 1878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 108 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 84 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2023-03-23 11:43:40] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2023-03-23 11:43:40] [INFO ] Invariant cache hit.
[2023-03-23 11:43:40] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-23 11:43:40] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2023-03-23 11:43:40] [INFO ] Invariant cache hit.
[2023-03-23 11:43:40] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:43:42] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2023-03-23 11:43:42] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-23 11:43:42] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2023-03-23 11:43:42] [INFO ] Invariant cache hit.
[2023-03-23 11:43:42] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2632 ms. Remains : 632/632 places, 1644/1644 transitions.
Graph (trivial) has 968 edges and 632 vertex of which 192 / 632 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 417 transitions
Reduce isomorphic transitions removed 737 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 504 transition count 895
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 492 transition count 895
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 25 place count 492 transition count 816
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 183 place count 413 transition count 816
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 350 transition count 753
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 350 transition count 753
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 350 transition count 627
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 689 place count 223 transition count 500
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 753 place count 159 transition count 372
Iterating global reduction 3 with 64 rules applied. Total rules applied 817 place count 159 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 818 place count 159 transition count 371
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 881 place count 96 transition count 245
Iterating global reduction 4 with 63 rules applied. Total rules applied 944 place count 96 transition count 245
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1007 place count 33 transition count 119
Iterating global reduction 4 with 63 rules applied. Total rules applied 1070 place count 33 transition count 119
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1133 place count 33 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1133 place count 33 transition count 55
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 1135 place count 32 transition count 55
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 1137 place count 31 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1143 place count 28 transition count 54
Applied a total of 1143 rules in 61 ms. Remains 28 /632 variables (removed 604) and now considering 54/1644 (removed 1590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 54 rows 28 cols
[2023-03-23 11:43:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:43:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:43:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:43:42] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-23 11:43:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:43:42] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:42] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:43:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:43:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:43:42] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:42] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:43:42] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 11:43:42] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(p0))'
Support contains 2 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 719 transition count 1872
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 719 transition count 1872
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 719 transition count 1868
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 707 transition count 1838
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 707 transition count 1838
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 695 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 695 transition count 1800
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 681 transition count 1752
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 681 transition count 1752
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 118 place count 667 transition count 1716
Iterating global reduction 1 with 14 rules applied. Total rules applied 132 place count 667 transition count 1716
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 146 place count 653 transition count 1688
Iterating global reduction 1 with 14 rules applied. Total rules applied 160 place count 653 transition count 1688
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 174 place count 639 transition count 1660
Iterating global reduction 1 with 14 rules applied. Total rules applied 188 place count 639 transition count 1660
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 200 place count 627 transition count 1634
Iterating global reduction 1 with 12 rules applied. Total rules applied 212 place count 627 transition count 1634
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 616 transition count 1610
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 616 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 239 place count 611 transition count 1600
Iterating global reduction 1 with 5 rules applied. Total rules applied 244 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 245 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 246 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 247 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 248 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 251 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 252 place count 607 transition count 1592
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 607 transition count 1590
Applied a total of 254 rules in 592 ms. Remains 607 /731 variables (removed 124) and now considering 1590/1900 (removed 310) transitions.
[2023-03-23 11:43:43] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-23 11:43:43] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 11:43:44] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-23 11:43:44] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-23 11:43:44] [INFO ] Invariant cache hit.
[2023-03-23 11:43:44] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-23 11:43:45] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-23 11:43:45] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-23 11:43:45] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-23 11:43:45] [INFO ] Invariant cache hit.
[2023-03-23 11:43:46] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/731 places, 1590/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2911 ms. Remains : 607/731 places, 1590/1900 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s521 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 73 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 3130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1878
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1878
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 721 transition count 1872
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 711 transition count 1848
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 711 transition count 1848
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 702 transition count 1820
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 702 transition count 1820
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 691 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 691 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 97 place count 680 transition count 1752
Iterating global reduction 1 with 11 rules applied. Total rules applied 108 place count 680 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 119 place count 669 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 130 place count 669 transition count 1730
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 141 place count 658 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 152 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 648 transition count 1686
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 648 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 639 transition count 1666
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 639 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 634 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 632 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 631 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 630 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 630 transition count 1648
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 214 place count 630 transition count 1642
Applied a total of 214 rules in 439 ms. Remains 630 /731 variables (removed 101) and now considering 1642/1900 (removed 258) transitions.
[2023-03-23 11:43:46] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
// Phase 1: matrix 1098 rows 630 cols
[2023-03-23 11:43:46] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 11:43:47] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-23 11:43:47] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-23 11:43:47] [INFO ] Invariant cache hit.
[2023-03-23 11:43:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:43:48] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
[2023-03-23 11:43:48] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 11:43:48] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-23 11:43:48] [INFO ] Invariant cache hit.
[2023-03-23 11:43:49] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/731 places, 1642/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2913 ms. Remains : 630/731 places, 1642/1900 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-02 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}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s543 1)), p0:(OR (AND (GEQ s1 1) (GEQ s551 1)) (AND (GEQ s1 1) (GEQ s550 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Stack based approach found an accepted trace after 280 steps with 0 reset with depth 281 and stack size 281 in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-02 finished in 3546 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((p0||X(p1))))'
Support contains 3 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 720 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 720 transition count 1874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 720 transition count 1872
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 35 place count 709 transition count 1844
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 709 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 699 transition count 1810
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 699 transition count 1810
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 689 transition count 1778
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 689 transition count 1778
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 679 transition count 1758
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 679 transition count 1758
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 116 place count 669 transition count 1738
Iterating global reduction 1 with 10 rules applied. Total rules applied 126 place count 669 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 136 place count 659 transition count 1718
Iterating global reduction 1 with 10 rules applied. Total rules applied 146 place count 659 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 156 place count 649 transition count 1692
Iterating global reduction 1 with 10 rules applied. Total rules applied 166 place count 649 transition count 1692
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 175 place count 640 transition count 1668
Iterating global reduction 1 with 9 rules applied. Total rules applied 184 place count 640 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 637 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 190 place count 637 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 634 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 634 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 199 place count 631 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 202 place count 631 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 205 place count 628 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 208 place count 628 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 211 place count 625 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 214 place count 625 transition count 1638
Applied a total of 214 rules in 225 ms. Remains 625 /731 variables (removed 106) and now considering 1638/1900 (removed 262) transitions.
[2023-03-23 11:43:50] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 625 cols
[2023-03-23 11:43:50] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 11:43:50] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-23 11:43:50] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-23 11:43:50] [INFO ] Invariant cache hit.
[2023-03-23 11:43:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:43:52] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2023-03-23 11:43:52] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-23 11:43:52] [INFO ] Invariant cache hit.
[2023-03-23 11:43:52] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/731 places, 1638/1900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 625/731 places, 1638/1900 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s554 1)), p1:(AND (GEQ s1 1) (GEQ s553 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-03 finished in 2910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 719 transition count 1872
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 719 transition count 1872
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 719 transition count 1866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 707 transition count 1836
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 707 transition count 1836
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 696 transition count 1802
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 696 transition count 1802
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 683 transition count 1758
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 683 transition count 1758
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 115 place count 670 transition count 1724
Iterating global reduction 1 with 13 rules applied. Total rules applied 128 place count 670 transition count 1724
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 141 place count 657 transition count 1698
Iterating global reduction 1 with 13 rules applied. Total rules applied 154 place count 657 transition count 1698
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 167 place count 644 transition count 1672
Iterating global reduction 1 with 13 rules applied. Total rules applied 180 place count 644 transition count 1672
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 633 transition count 1648
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 633 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 212 place count 623 transition count 1626
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 618 transition count 1616
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 244 place count 614 transition count 1604
Applied a total of 244 rules in 383 ms. Remains 614 /731 variables (removed 117) and now considering 1604/1900 (removed 296) transitions.
[2023-03-23 11:43:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 11:43:53] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 11:43:53] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-23 11:43:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:43:53] [INFO ] Invariant cache hit.
[2023-03-23 11:43:53] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:43:54] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2023-03-23 11:43:55] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 11:43:55] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:43:55] [INFO ] Invariant cache hit.
[2023-03-23 11:43:55] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/731 places, 1604/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2816 ms. Remains : 614/731 places, 1604/1900 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s542 1)), p1:(AND (GEQ s1 1) (GEQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 0 reset in 627 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 296246 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296246 steps, saw 192295 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:00] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:00] [INFO ] Invariant cache hit.
[2023-03-23 11:44:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:00] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 11:44:01] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:01] [INFO ] After 346ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-23 11:44:02] [INFO ] After 1004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-23 11:44:02] [INFO ] After 1996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 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 71 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.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) 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 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 321061 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 321061 steps, saw 208399 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:06] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:06] [INFO ] Invariant cache hit.
[2023-03-23 11:44:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:06] [INFO ] After 750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:44:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:44:07] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:07] [INFO ] After 348ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-23 11:44:08] [INFO ] After 1003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-23 11:44:08] [INFO ] After 1978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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 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 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 11:44:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:08] [INFO ] Invariant cache hit.
[2023-03-23 11:44:09] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-23 11:44:09] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:09] [INFO ] Invariant cache hit.
[2023-03-23 11:44:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:10] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2023-03-23 11:44:10] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 11:44:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:10] [INFO ] Invariant cache hit.
[2023-03-23 11:44:11] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2360 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 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 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
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 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
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 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 34 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-23 11:44:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:44:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:44:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-23 11:44:11] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:44:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:11] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:44:11] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:11] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 11:44:11] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 85 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 11:44:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 11:44:11] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 11:44:12] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-23 11:44:12] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:12] [INFO ] Invariant cache hit.
[2023-03-23 11:44:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:13] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-23 11:44:13] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 11:44:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:13] [INFO ] Invariant cache hit.
[2023-03-23 11:44:14] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2666 ms. Remains : 614/614 places, 1604/1604 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) 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 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 286698 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286698 steps, saw 186099 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:17] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:17] [INFO ] Invariant cache hit.
[2023-03-23 11:44:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:44:18] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:19] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:19] [INFO ] After 349ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:20] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 1 ms to minimize.
[2023-03-23 11:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-23 11:44:20] [INFO ] After 1009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-23 11:44:20] [INFO ] After 1986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) 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 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 312809 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312809 steps, saw 203045 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 11:44:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:23] [INFO ] Invariant cache hit.
[2023-03-23 11:44:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:24] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:44:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:25] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:25] [INFO ] After 347ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:26] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 0 ms to minimize.
[2023-03-23 11:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-23 11:44:26] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-23 11:44:26] [INFO ] After 1996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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-23 11:44:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:26] [INFO ] Invariant cache hit.
[2023-03-23 11:44:27] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-23 11:44:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:27] [INFO ] Invariant cache hit.
[2023-03-23 11:44:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:28] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2023-03-23 11:44:28] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 11:44:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:28] [INFO ] Invariant cache hit.
[2023-03-23 11:44:29] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2606 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 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 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
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 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
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 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 29 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-23 11:44:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:44:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:29] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:44:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:44:29] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:44:29] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:29] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 11:44:29] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 1 reset in 603 ms.
Built C files in :
/tmp/ltsmin10160880796533966425
[2023-03-23 11:44:30] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:44:30] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10160880796533966425
Running compilation step : cd /tmp/ltsmin10160880796533966425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10160880796533966425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10160880796533966425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 79 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 11:44:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 11:44:34] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 11:44:34] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-23 11:44:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:34] [INFO ] Invariant cache hit.
[2023-03-23 11:44:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 11:44:36] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2023-03-23 11:44:36] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 11:44:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 11:44:36] [INFO ] Invariant cache hit.
[2023-03-23 11:44:36] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2506 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin16270462289888576547
[2023-03-23 11:44:36] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:44:36] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16270462289888576547
Running compilation step : cd /tmp/ltsmin16270462289888576547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2850 ms.
Running link step : cd /tmp/ltsmin16270462289888576547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16270462289888576547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2340387946041601450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:44:51] [INFO ] Flatten gal took : 66 ms
[2023-03-23 11:44:51] [INFO ] Flatten gal took : 69 ms
[2023-03-23 11:44:51] [INFO ] Time to serialize gal into /tmp/LTL2897516016414035934.gal : 10 ms
[2023-03-23 11:44:51] [INFO ] Time to serialize properties into /tmp/LTL10952427895452842579.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2897516016414035934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8186274984466015562.hoa' '-atoms' '/tmp/LTL10952427895452842579.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10952427895452842579.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8186274984466015562.hoa
Detected timeout of ITS tools.
[2023-03-23 11:45:06] [INFO ] Flatten gal took : 51 ms
[2023-03-23 11:45:06] [INFO ] Flatten gal took : 47 ms
[2023-03-23 11:45:06] [INFO ] Time to serialize gal into /tmp/LTL14695739353651840707.gal : 7 ms
[2023-03-23 11:45:06] [INFO ] Time to serialize properties into /tmp/LTL5157544133523818650.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14695739353651840707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5157544133523818650.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
Detected timeout of ITS tools.
[2023-03-23 11:45:22] [INFO ] Flatten gal took : 48 ms
[2023-03-23 11:45:22] [INFO ] Applying decomposition
[2023-03-23 11:45:22] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15638963174871390254.txt' '-o' '/tmp/graph15638963174871390254.bin' '-w' '/tmp/graph15638963174871390254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15638963174871390254.bin' '-l' '-1' '-v' '-w' '/tmp/graph15638963174871390254.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:45:22] [INFO ] Decomposing Gal with order
[2023-03-23 11:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:45:22] [INFO ] Removed a total of 2664 redundant transitions.
[2023-03-23 11:45:22] [INFO ] Flatten gal took : 233 ms
[2023-03-23 11:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1108 labels/synchronizations in 86 ms.
[2023-03-23 11:45:22] [INFO ] Time to serialize gal into /tmp/LTL4679178600909733731.gal : 44 ms
[2023-03-23 11:45:22] [INFO ] Time to serialize properties into /tmp/LTL14780313808252292540.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4679178600909733731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14780313808252292540.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i24.i2.u153.l2083<1))")||(X(F("((i8.u1.s1>=1)&&(i7.u119.l976>=1))")))))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i24.i2.u153.l2083<1))" & FG!"((i8.u1.s1>=1)&&(i7.u119.l976>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17355285311063187623
[2023-03-23 11:45:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17355285311063187623
Running compilation step : cd /tmp/ltsmin17355285311063187623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2616 ms.
Running link step : cd /tmp/ltsmin17355285311063187623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17355285311063187623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 120319 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||G(p1)))))'
Support contains 4 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 720 transition count 1874
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 720 transition count 1874
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 720 transition count 1868
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 709 transition count 1840
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 709 transition count 1840
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 699 transition count 1808
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 699 transition count 1808
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 687 transition count 1766
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 687 transition count 1766
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 675 transition count 1734
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 675 transition count 1734
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 130 place count 663 transition count 1710
Iterating global reduction 1 with 12 rules applied. Total rules applied 142 place count 663 transition count 1710
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 651 transition count 1686
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 651 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 641 transition count 1666
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 641 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 632 transition count 1648
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 208 place count 628 transition count 1640
Iterating global reduction 1 with 4 rules applied. Total rules applied 212 place count 628 transition count 1640
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 218 place count 628 transition count 1634
Applied a total of 218 rules in 314 ms. Remains 628 /731 variables (removed 103) and now considering 1634/1900 (removed 266) transitions.
[2023-03-23 11:45:53] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-23 11:45:53] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 11:45:53] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-23 11:45:53] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:45:53] [INFO ] Invariant cache hit.
[2023-03-23 11:45:54] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:45:55] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
[2023-03-23 11:45:55] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 11:45:55] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:45:55] [INFO ] Invariant cache hit.
[2023-03-23 11:45:55] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 628/731 places, 1634/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2889 ms. Remains : 628/731 places, 1634/1900 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s556 1)), p0:(AND (GEQ s1 1) (GEQ s552 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Product exploration explored 100000 steps with 0 reset in 588 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:45:57] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:45:57] [INFO ] Invariant cache hit.
[2023-03-23 11:45:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:45:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:45:57] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:45:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:45:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:45:58] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:45:58] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:45:58] [INFO ] After 176ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:45:58] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-23 11:45:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-23 11:45:58] [INFO ] After 612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-23 11:45:59] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 79 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 542880 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542880 steps, saw 352361 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:46:02] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:02] [INFO ] Invariant cache hit.
[2023-03-23 11:46:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:46:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:02] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:46:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:03] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:03] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:03] [INFO ] After 205ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:03] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 1 ms to minimize.
[2023-03-23 11:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-23 11:46:03] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-23 11:46:03] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 75 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 69 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-23 11:46:04] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:04] [INFO ] Invariant cache hit.
[2023-03-23 11:46:04] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-23 11:46:04] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:04] [INFO ] Invariant cache hit.
[2023-03-23 11:46:04] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:05] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2023-03-23 11:46:05] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 11:46:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:05] [INFO ] Invariant cache hit.
[2023-03-23 11:46:06] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2417 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 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 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
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 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
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 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
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 1137 place count 27 transition count 46
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 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 30 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-23 11:46:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:46:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:46:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 11:46:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:46:06] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:06] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 11:46:06] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 86 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-23 11:46:06] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-23 11:46:06] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 11:46:07] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-23 11:46:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:07] [INFO ] Invariant cache hit.
[2023-03-23 11:46:07] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:08] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2023-03-23 11:46:08] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 11:46:08] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:08] [INFO ] Invariant cache hit.
[2023-03-23 11:46:09] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2415 ms. Remains : 628/628 places, 1634/1634 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:46:09] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:09] [INFO ] Invariant cache hit.
[2023-03-23 11:46:09] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:46:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:09] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:46:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:10] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:10] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:10] [INFO ] After 176ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:10] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-23 11:46:10] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-23 11:46:11] [INFO ] After 1097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 69 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 544596 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544596 steps, saw 353476 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 11:46:14] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:14] [INFO ] Invariant cache hit.
[2023-03-23 11:46:14] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:46:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:46:14] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:46:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:46:15] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:15] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:15] [INFO ] After 183ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:15] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2023-03-23 11:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-23 11:46:15] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-23 11:46:15] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 70 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-23 11:46:15] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:15] [INFO ] Invariant cache hit.
[2023-03-23 11:46:16] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-23 11:46:16] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:16] [INFO ] Invariant cache hit.
[2023-03-23 11:46:16] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:17] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
[2023-03-23 11:46:17] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-23 11:46:17] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:17] [INFO ] Invariant cache hit.
[2023-03-23 11:46:18] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2390 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 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 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
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 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
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 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
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 1137 place count 27 transition count 46
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 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 32 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-23 11:46:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:46:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:46:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:46:18] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 11:46:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:46:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:46:18] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:46:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 11:46:18] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 11:46:18] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 479 ms.
Product exploration explored 100000 steps with 0 reset in 505 ms.
Built C files in :
/tmp/ltsmin6637984806697810280
[2023-03-23 11:46:19] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:46:19] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6637984806697810280
Running compilation step : cd /tmp/ltsmin6637984806697810280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2763 ms.
Running link step : cd /tmp/ltsmin6637984806697810280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6637984806697810280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17731458457068940838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 91 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-23 11:46:34] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-23 11:46:34] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 11:46:35] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-23 11:46:35] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:35] [INFO ] Invariant cache hit.
[2023-03-23 11:46:35] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-23 11:46:36] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2023-03-23 11:46:36] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 11:46:36] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-23 11:46:36] [INFO ] Invariant cache hit.
[2023-03-23 11:46:37] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2458 ms. Remains : 628/628 places, 1634/1634 transitions.
Built C files in :
/tmp/ltsmin4530018942693592295
[2023-03-23 11:46:37] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:46:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4530018942693592295
Running compilation step : cd /tmp/ltsmin4530018942693592295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2858 ms.
Running link step : cd /tmp/ltsmin4530018942693592295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4530018942693592295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15176210430522381961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:46:52] [INFO ] Flatten gal took : 41 ms
[2023-03-23 11:46:52] [INFO ] Flatten gal took : 44 ms
[2023-03-23 11:46:52] [INFO ] Time to serialize gal into /tmp/LTL14337049436692538848.gal : 7 ms
[2023-03-23 11:46:52] [INFO ] Time to serialize properties into /tmp/LTL13396320139064415378.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14337049436692538848.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10148765184593719913.hoa' '-atoms' '/tmp/LTL13396320139064415378.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13396320139064415378.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10148765184593719913.hoa
Detected timeout of ITS tools.
[2023-03-23 11:47:07] [INFO ] Flatten gal took : 40 ms
[2023-03-23 11:47:07] [INFO ] Flatten gal took : 41 ms
[2023-03-23 11:47:07] [INFO ] Time to serialize gal into /tmp/LTL15303644665867575471.gal : 6 ms
[2023-03-23 11:47:07] [INFO ] Time to serialize properties into /tmp/LTL13175267044038767572.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15303644665867575471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13175267044038767572.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l2079<1))"))||("((s1>=1)&&(l1979>=1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l2079<1))" & FG!"((s1>=1)&&(l1979>=1))")
Detected timeout of ITS tools.
[2023-03-23 11:47:22] [INFO ] Flatten gal took : 38 ms
[2023-03-23 11:47:22] [INFO ] Applying decomposition
[2023-03-23 11:47:22] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph206099453687670132.txt' '-o' '/tmp/graph206099453687670132.bin' '-w' '/tmp/graph206099453687670132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph206099453687670132.bin' '-l' '-1' '-v' '-w' '/tmp/graph206099453687670132.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:47:22] [INFO ] Decomposing Gal with order
[2023-03-23 11:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:47:22] [INFO ] Removed a total of 2726 redundant transitions.
[2023-03-23 11:47:22] [INFO ] Flatten gal took : 93 ms
[2023-03-23 11:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1160 labels/synchronizations in 56 ms.
[2023-03-23 11:47:23] [INFO ] Time to serialize gal into /tmp/LTL5315871970173657822.gal : 9 ms
[2023-03-23 11:47:23] [INFO ] Time to serialize properties into /tmp/LTL2849994878828742038.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5315871970173657822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2849994878828742038.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i1.u1.s0<1)||(i25.i5.u161.l2079<1))"))||("((i11.i0.u0.s1>=1)&&(i25.i4.u164.l1979>=1))")))))
Formula 0 simplified : G(F!"((i1.u1.s0<1)||(i25.i5.u161.l2079<1))" & FG!"((i11.i0.u0.s1>=1)&&(i25.i4.u164.l1979>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9270265297434446910
[2023-03-23 11:47:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9270265297434446910
Running compilation step : cd /tmp/ltsmin9270265297434446910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2831 ms.
Running link step : cd /tmp/ltsmin9270265297434446910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9270265297434446910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 120137 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)&&F((G(F(!p1))||(F(!p1)&&G(!p2)))))) U p2))'
Support contains 5 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1878
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1878
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 721 transition count 1872
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 711 transition count 1850
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 711 transition count 1850
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 702 transition count 1822
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 702 transition count 1822
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 691 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 691 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 97 place count 680 transition count 1752
Iterating global reduction 1 with 11 rules applied. Total rules applied 108 place count 680 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 119 place count 669 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 130 place count 669 transition count 1730
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 141 place count 658 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 152 place count 658 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 648 transition count 1686
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 648 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 182 place count 638 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 192 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 197 place count 633 transition count 1654
Iterating global reduction 1 with 5 rules applied. Total rules applied 202 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 632 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 631 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 630 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 630 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 629 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 629 transition count 1646
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 216 place count 629 transition count 1640
Applied a total of 216 rules in 360 ms. Remains 629 /731 variables (removed 102) and now considering 1640/1900 (removed 260) transitions.
[2023-03-23 11:47:53] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-23 11:47:53] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 11:47:53] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-23 11:47:53] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:47:53] [INFO ] Invariant cache hit.
[2023-03-23 11:47:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:47:55] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
[2023-03-23 11:47:55] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 11:47:55] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:47:55] [INFO ] Invariant cache hit.
[2023-03-23 11:47:55] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/731 places, 1640/1900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2517 ms. Remains : 629/731 places, 1640/1900 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), p0, (OR p0 p1), p1]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s543 1)), p0:(AND (GEQ s1 1) (GEQ s547 1)), p1:(AND (GEQ s0 1) (GEQ s557 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 0 reset in 571 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 557 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=87 ) 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
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 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 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 212357 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212357 steps, saw 137852 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 11:48:00] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:00] [INFO ] Invariant cache hit.
[2023-03-23 11:48:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:01] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 11:48:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:02] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 11:48:02] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:03] [INFO ] After 771ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 11:48:03] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2023-03-23 11:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-23 11:48:03] [INFO ] After 1662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-03-23 11:48:04] [INFO ] After 3078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 1638
Applied a total of 2 rules in 151 ms. Remains 629 /629 variables (removed 0) and now considering 1638/1640 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 629/629 places, 1638/1640 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :2
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
Running SMT prover for 3 properties.
[2023-03-23 11:48:04] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
// Phase 1: matrix 1096 rows 629 cols
[2023-03-23 11:48:04] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-23 11:48:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:05] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:05] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:06] [INFO ] After 437ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:06] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2023-03-23 11:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-23 11:48:06] [INFO ] After 997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-23 11:48:07] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 628 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 628 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 627 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 627 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 626 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 626 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 625 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 625 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 624 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 623 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 622 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 621 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 621 transition count 1620
Applied a total of 16 rules in 166 ms. Remains 621 /629 variables (removed 8) and now considering 1620/1638 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 621/629 places, 1620/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 190511 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190511 steps, saw 123673 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 11:48:10] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
// Phase 1: matrix 1083 rows 621 cols
[2023-03-23 11:48:10] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 11:48:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:48:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:11] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:11] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:48:12] [INFO ] After 447ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:12] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-23 11:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-23 11:48:12] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 235 ms.
[2023-03-23 11:48:12] [INFO ] After 1967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 70 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 621/621 places, 1620/1620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 69 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2023-03-23 11:48:13] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:13] [INFO ] Invariant cache hit.
[2023-03-23 11:48:13] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-23 11:48:13] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:13] [INFO ] Invariant cache hit.
[2023-03-23 11:48:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:48:14] [INFO ] Implicit Places using invariants and state equation in 1381 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2023-03-23 11:48:14] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 11:48:14] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:14] [INFO ] Invariant cache hit.
[2023-03-23 11:48:15] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2326 ms. Remains : 621/621 places, 1620/1620 transitions.
Graph (trivial) has 950 edges and 621 vertex of which 192 / 621 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 409 transitions
Reduce isomorphic transitions removed 729 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 493 transition count 881
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 483 transition count 881
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 21 place count 483 transition count 806
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 171 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 234 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 297 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 423 place count 345 transition count 617
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 679 place count 217 transition count 489
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 743 place count 153 transition count 361
Iterating global reduction 3 with 64 rules applied. Total rules applied 807 place count 153 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 809 place count 153 transition count 359
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 872 place count 90 transition count 233
Iterating global reduction 4 with 63 rules applied. Total rules applied 935 place count 90 transition count 233
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 998 place count 27 transition count 107
Iterating global reduction 4 with 63 rules applied. Total rules applied 1061 place count 27 transition count 107
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1124 place count 27 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1124 place count 27 transition count 43
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 1126 place count 26 transition count 43
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 1128 place count 25 transition count 42
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 1130 place count 24 transition count 42
Applied a total of 1130 rules in 26 ms. Remains 24 /621 variables (removed 597) and now considering 42/1620 (removed 1578) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-23 11:48:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 11:48:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:48:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:15] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 11:48:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:48:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:15] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:48:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-23 11:48:15] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:15] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:15] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 11:48:15] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 558 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-23 11:48:16] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-23 11:48:16] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 11:48:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:48:18] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2023-03-23 11:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:48:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-23 11:48:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 11:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:48:20] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-23 11:48:20] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:20] [INFO ] [Nat]Added 271 Read/Feed constraints in 94 ms returned sat
[2023-03-23 11:48:20] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 190 ms.
[2023-03-23 11:48:20] [INFO ] Added : 20 causal constraints over 5 iterations in 618 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Applied a total of 0 rules in 82 ms. Remains 629 /629 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-23 11:48:20] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:20] [INFO ] Invariant cache hit.
[2023-03-23 11:48:21] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-23 11:48:21] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:21] [INFO ] Invariant cache hit.
[2023-03-23 11:48:21] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:22] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
[2023-03-23 11:48:22] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 11:48:22] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:22] [INFO ] Invariant cache hit.
[2023-03-23 11:48:23] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2196 ms. Remains : 629/629 places, 1640/1640 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 520 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=87 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 11:48:23] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:23] [INFO ] Invariant cache hit.
[2023-03-23 11:48:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:24] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 11:48:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:24] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:25] [INFO ] After 401ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:25] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 0 ms to minimize.
[2023-03-23 11:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-23 11:48:25] [INFO ] After 1045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-23 11:48:26] [INFO ] After 2027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 628 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 628 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 627 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 626 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 625 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 624 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 624 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 623 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 622 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 621 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 621 transition count 1622
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 621 transition count 1620
Applied a total of 18 rules in 231 ms. Remains 621 /629 variables (removed 8) and now considering 1620/1640 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 621/629 places, 1620/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 298276 steps, run timeout after 3002 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298276 steps, saw 193614 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 11:48:29] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
// Phase 1: matrix 1083 rows 621 cols
[2023-03-23 11:48:29] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 11:48:29] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:48:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:30] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 11:48:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:30] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:48:31] [INFO ] After 429ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:31] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2023-03-23 11:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-23 11:48:31] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-23 11:48:32] [INFO ] After 1895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 74 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 621/621 places, 1620/1620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1620/1620 transitions.
Applied a total of 0 rules in 67 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2023-03-23 11:48:32] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:32] [INFO ] Invariant cache hit.
[2023-03-23 11:48:32] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-23 11:48:32] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:32] [INFO ] Invariant cache hit.
[2023-03-23 11:48:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 11:48:33] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
[2023-03-23 11:48:33] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 11:48:33] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-23 11:48:33] [INFO ] Invariant cache hit.
[2023-03-23 11:48:34] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2196 ms. Remains : 621/621 places, 1620/1620 transitions.
Graph (trivial) has 950 edges and 621 vertex of which 192 / 621 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 409 transitions
Reduce isomorphic transitions removed 729 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 493 transition count 881
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 483 transition count 881
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 21 place count 483 transition count 806
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 171 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 234 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 297 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 423 place count 345 transition count 617
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 679 place count 217 transition count 489
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 743 place count 153 transition count 361
Iterating global reduction 3 with 64 rules applied. Total rules applied 807 place count 153 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 809 place count 153 transition count 359
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 872 place count 90 transition count 233
Iterating global reduction 4 with 63 rules applied. Total rules applied 935 place count 90 transition count 233
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 998 place count 27 transition count 107
Iterating global reduction 4 with 63 rules applied. Total rules applied 1061 place count 27 transition count 107
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1124 place count 27 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1124 place count 27 transition count 43
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 1126 place count 26 transition count 43
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 1128 place count 25 transition count 42
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 1130 place count 24 transition count 42
Applied a total of 1130 rules in 26 ms. Remains 24 /621 variables (removed 597) and now considering 42/1620 (removed 1578) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-23 11:48:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 11:48:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:48:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 11:48:34] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 11:48:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 11:48:34] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:34] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:48:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 11:48:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 11:48:34] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:34] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 11:48:34] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 11:48:34] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 612 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-23 11:48:35] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-23 11:48:35] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 11:48:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 11:48:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 11:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 11:48:37] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-23 11:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 11:48:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2023-03-23 11:48:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-23 11:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 11:48:39] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-23 11:48:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:39] [INFO ] [Nat]Added 271 Read/Feed constraints in 93 ms returned sat
[2023-03-23 11:48:39] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 95 ms.
[2023-03-23 11:48:39] [INFO ] Added : 20 causal constraints over 5 iterations in 505 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), p0, (OR p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 399 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Built C files in :
/tmp/ltsmin642854364894887992
[2023-03-23 11:48:40] [INFO ] Too many transitions (1640) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:48:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin642854364894887992
Running compilation step : cd /tmp/ltsmin642854364894887992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2825 ms.
Running link step : cd /tmp/ltsmin642854364894887992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin642854364894887992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3635577178567861819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 629 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 629/629 places, 1640/1640 transitions.
Applied a total of 0 rules in 78 ms. Remains 629 /629 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-23 11:48:55] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:55] [INFO ] Invariant cache hit.
[2023-03-23 11:48:56] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-23 11:48:56] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:56] [INFO ] Invariant cache hit.
[2023-03-23 11:48:56] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 11:48:58] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2023-03-23 11:48:58] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 11:48:58] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-23 11:48:58] [INFO ] Invariant cache hit.
[2023-03-23 11:48:58] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2749 ms. Remains : 629/629 places, 1640/1640 transitions.
Built C files in :
/tmp/ltsmin12265108977634038052
[2023-03-23 11:48:58] [INFO ] Too many transitions (1640) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:48:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12265108977634038052
Running compilation step : cd /tmp/ltsmin12265108977634038052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2856 ms.
Running link step : cd /tmp/ltsmin12265108977634038052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12265108977634038052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased831568272292645125.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 11:49:13] [INFO ] Flatten gal took : 35 ms
[2023-03-23 11:49:13] [INFO ] Flatten gal took : 33 ms
[2023-03-23 11:49:13] [INFO ] Time to serialize gal into /tmp/LTL5377800217587928398.gal : 5 ms
[2023-03-23 11:49:13] [INFO ] Time to serialize properties into /tmp/LTL3438214920293980224.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5377800217587928398.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9231202642710177662.hoa' '-atoms' '/tmp/LTL3438214920293980224.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3438214920293980224.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9231202642710177662.hoa
Detected timeout of ITS tools.
[2023-03-23 11:49:28] [INFO ] Flatten gal took : 34 ms
[2023-03-23 11:49:28] [INFO ] Flatten gal took : 36 ms
[2023-03-23 11:49:28] [INFO ] Time to serialize gal into /tmp/LTL1684768942970381728.gal : 10 ms
[2023-03-23 11:49:28] [INFO ] Time to serialize properties into /tmp/LTL15449415926470226689.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1684768942970381728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15449415926470226689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((s1>=1)&&(l1593>=1))")))&&(F((G(F(!("((s0>=1)&&(l2072>=1))"))))||((F(!("((s0>=1)&&(l2072>=1))")))&&(G(!("((s1>=1)&&(l1484...197
Formula 0 simplified : F(G"((s1>=1)&&(l1593>=1))" | G(FG"((s0>=1)&&(l2072>=1))" & (G"((s0>=1)&&(l2072>=1))" | F"((s1>=1)&&(l1484>=1))"))) R !"((s1>=1)&&(l1...164
Detected timeout of ITS tools.
[2023-03-23 11:49:43] [INFO ] Flatten gal took : 38 ms
[2023-03-23 11:49:43] [INFO ] Applying decomposition
[2023-03-23 11:49:43] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14577000749588144598.txt' '-o' '/tmp/graph14577000749588144598.bin' '-w' '/tmp/graph14577000749588144598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14577000749588144598.bin' '-l' '-1' '-v' '-w' '/tmp/graph14577000749588144598.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:49:44] [INFO ] Decomposing Gal with order
[2023-03-23 11:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:49:44] [INFO ] Removed a total of 2728 redundant transitions.
[2023-03-23 11:49:44] [INFO ] Flatten gal took : 88 ms
[2023-03-23 11:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1117 labels/synchronizations in 39 ms.
[2023-03-23 11:49:44] [INFO ] Time to serialize gal into /tmp/LTL5693585990728041528.gal : 14 ms
[2023-03-23 11:49:44] [INFO ] Time to serialize properties into /tmp/LTL7964707086124579371.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5693585990728041528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7964707086124579371.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((i1.u2.s1>=1)&&(i25.i1.i2.u150.l1593>=1))")))&&(F((G(F(!("((i0.u1.s0>=1)&&(i25.i1.i3.u153.l2072>=1))"))))||((F(!("((i0.u1...302
Formula 0 simplified : F(G"((i1.u2.s1>=1)&&(i25.i1.i2.u150.l1593>=1))" | G(FG"((i0.u1.s0>=1)&&(i25.i1.i3.u153.l2072>=1))" & (G"((i0.u1.s0>=1)&&(i25.i1.i3.u...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4712335791358066118
[2023-03-23 11:49:59] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4712335791358066118
Running compilation step : cd /tmp/ltsmin4712335791358066118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2783 ms.
Running link step : cd /tmp/ltsmin4712335791358066118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4712335791358066118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>(!(LTLAPp0==true))&&<>(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&[](!(LTLAPp2==true))))))) U (LTLAPp2==true))' '--buchi-type=spotba'
LTSmin run took 457 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c008-LTLFireability-14 finished in 129480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
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||G(p1)))))'
[2023-03-23 11:50:02] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15592458857919512366
[2023-03-23 11:50:02] [INFO ] Too many transitions (1900) to apply POR reductions. Disabling POR matrices.
[2023-03-23 11:50:02] [INFO ] Applying decomposition
[2023-03-23 11:50:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15592458857919512366
Running compilation step : cd /tmp/ltsmin15592458857919512366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 11:50:03] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9116150463586333893.txt' '-o' '/tmp/graph9116150463586333893.bin' '-w' '/tmp/graph9116150463586333893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9116150463586333893.bin' '-l' '-1' '-v' '-w' '/tmp/graph9116150463586333893.weights' '-q' '0' '-e' '0.001'
[2023-03-23 11:50:03] [INFO ] Decomposing Gal with order
[2023-03-23 11:50:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 11:50:03] [INFO ] Removed a total of 3143 redundant transitions.
[2023-03-23 11:50:03] [INFO ] Flatten gal took : 78 ms
[2023-03-23 11:50:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1294 labels/synchronizations in 48 ms.
[2023-03-23 11:50:03] [INFO ] Time to serialize gal into /tmp/LTLFireability13754561043996867765.gal : 9 ms
[2023-03-23 11:50:03] [INFO ] Time to serialize properties into /tmp/LTLFireability4445143308838422696.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13754561043996867765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4445143308838422696.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G(("((i29.u1.s0<1)||(i0.u183.l2083<1))")||(X(F("((i1.u2.s1>=1)&&(i12.u121.l976>=1))")))))))
Formula 0 simplified : G(F!"((i29.u1.s0<1)||(i0.u183.l2083<1))" & FG!"((i1.u2.s1>=1)&&(i12.u121.l976>=1))")
Compilation finished in 3459 ms.
Running link step : cd /tmp/ltsmin15592458857919512366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15592458857919512366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: LTL layer: formula: <>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: "<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.024: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.324: There are 1905 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.324: State length is 732, there are 1906 groups
pins2lts-mc-linux64( 0/ 8), 0.324: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.324: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.324: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.324: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.445: [Blue] ~120 levels ~960 states ~7048 transitions
pins2lts-mc-linux64( 1/ 8), 0.539: [Blue] ~240 levels ~1920 states ~9264 transitions
pins2lts-mc-linux64( 1/ 8), 0.726: [Blue] ~480 levels ~3840 states ~17424 transitions
pins2lts-mc-linux64( 2/ 8), 1.054: [Blue] ~960 levels ~7680 states ~59464 transitions
pins2lts-mc-linux64( 1/ 8), 1.738: [Blue] ~1920 levels ~15360 states ~66384 transitions
pins2lts-mc-linux64( 1/ 8), 2.880: [Blue] ~3840 levels ~30720 states ~131664 transitions
pins2lts-mc-linux64( 1/ 8), 4.885: [Blue] ~7680 levels ~61440 states ~262224 transitions
pins2lts-mc-linux64( 1/ 8), 8.577: [Blue] ~15360 levels ~122880 states ~523344 transitions
pins2lts-mc-linux64( 1/ 8), 15.391: [Blue] ~30720 levels ~245760 states ~1045584 transitions
pins2lts-mc-linux64( 1/ 8), 29.050: [Blue] ~61440 levels ~491520 states ~2090064 transitions
pins2lts-mc-linux64( 1/ 8), 56.216: [Blue] ~122880 levels ~983040 states ~4179024 transitions
pins2lts-mc-linux64( 1/ 8), 110.905: [Blue] ~245760 levels ~1966080 states ~8356944 transitions
pins2lts-mc-linux64( 2/ 8), 189.432: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 189.731:
pins2lts-mc-linux64( 0/ 8), 189.731: Explored 3248151 states 22512334 transitions, fanout: 6.931
pins2lts-mc-linux64( 0/ 8), 189.731: Total exploration time 189.400 sec (189.100 sec minimum, 189.181 sec on average)
pins2lts-mc-linux64( 0/ 8), 189.731: States per second: 17150, Transitions per second: 118861
pins2lts-mc-linux64( 0/ 8), 189.731:
pins2lts-mc-linux64( 0/ 8), 189.731: State space has 21141543 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 189.731: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 189.731: blue states: 3248151 (15.36%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 189.731: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 189.731: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 189.731:
pins2lts-mc-linux64( 0/ 8), 189.731: Total memory used for local state coloring: 48.9MB
pins2lts-mc-linux64( 0/ 8), 189.731:
pins2lts-mc-linux64( 0/ 8), 189.731: Queue width: 8B, total height: 3207237, memory: 24.47MB
pins2lts-mc-linux64( 0/ 8), 189.731: Tree memory: 417.3MB, 20.7 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 189.731: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 189.731: Stored 2046 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 189.731: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 189.731: Est. total memory use: 441.8MB (~1048.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15592458857919512366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15592458857919512366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 12:12:19] [INFO ] Flatten gal took : 40 ms
[2023-03-23 12:12:19] [INFO ] Time to serialize gal into /tmp/LTLFireability10848005641201696519.gal : 7 ms
[2023-03-23 12:12:19] [INFO ] Time to serialize properties into /tmp/LTLFireability16599524378620729780.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10848005641201696519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16599524378620729780.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
Detected timeout of ITS tools.
[2023-03-23 12:35:26] [INFO ] Flatten gal took : 308 ms
[2023-03-23 12:35:28] [INFO ] Input system was already deterministic with 1900 transitions.
[2023-03-23 12:35:28] [INFO ] Transformed 731 places.
[2023-03-23 12:35:28] [INFO ] Transformed 1900 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 12:35:28] [INFO ] Time to serialize gal into /tmp/LTLFireability8403166873007535656.gal : 8 ms
[2023-03-23 12:35:28] [INFO ] Time to serialize properties into /tmp/LTLFireability7866398371981092127.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8403166873007535656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7866398371981092127.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5184968 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16175544 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c008, 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 r165-tall-167838850800732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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