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.r169-tall-167838856300732.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300732
=====================================================================

--------------------
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 1678630172038

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:09:34] [INFO ] Load time of PNML (sax parser for PT used): 474 ms
[2023-03-12 14:09:34] [INFO ] Transformed 2826 places.
[2023-03-12 14:09:34] [INFO ] Transformed 8960 transitions.
[2023-03-12 14:09:34] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 32 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 1213 ms. Remains 731 /1628 variables (removed 897) and now considering 1900/5962 (removed 4062) transitions.
[2023-03-12 14:09:35] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
// Phase 1: matrix 1274 rows 731 cols
[2023-03-12 14:09:35] [INFO ] Computed 2 place invariants in 41 ms
[2023-03-12 14:09:36] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-12 14:09:36] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-12 14:09:36] [INFO ] Invariant cache hit.
[2023-03-12 14:09:36] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-12 14:09:38] [INFO ] Implicit Places using invariants and state equation in 1984 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
[2023-03-12 14:09:38] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-12 14:09:38] [INFO ] Invariant cache hit.
[2023-03-12 14:09:39] [INFO ] Dead Transitions using invariants and state equation in 709 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 4741 ms. Remains : 731/1628 places, 1900/5962 transitions.
Support contains 16 out of 731 places after structural reductions.
[2023-03-12 14:09:39] [INFO ] Flatten gal took : 152 ms
[2023-03-12 14:09:39] [INFO ] Flatten gal took : 91 ms
[2023-03-12 14:09:39] [INFO ] Input system was already deterministic with 1900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) 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 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-12 14:09:40] [INFO ] Flow matrix only has 1274 transitions (discarded 626 similar events)
[2023-03-12 14:09:40] [INFO ] Invariant cache hit.
[2023-03-12 14:09:40] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:09:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:09:40] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:09:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:09:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:09:41] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:41] [INFO ] State equation strengthened by 307 read => feed constraints.
[2023-03-12 14:09:42] [INFO ] After 756ms SMT Verify possible using 307 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:43] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 5 ms to minimize.
[2023-03-12 14:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-12 14:09:43] [INFO ] After 1665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-12 14:09:43] [INFO ] After 3215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1900/1900 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 724 transition count 1882
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 724 transition count 1882
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 724 transition count 1876
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 717 transition count 1856
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 717 transition count 1856
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 711 transition count 1840
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 711 transition count 1840
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 703 transition count 1814
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 703 transition count 1814
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 695 transition count 1790
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 695 transition count 1790
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 687 transition count 1774
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 687 transition count 1774
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 679 transition count 1758
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 679 transition count 1758
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 673 transition count 1746
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 673 transition count 1746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 668 transition count 1736
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 668 transition count 1736
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 136 place count 664 transition count 1728
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 664 transition count 1728
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 154 place count 664 transition count 1714
Applied a total of 154 rules in 512 ms. Remains 664 /731 variables (removed 67) and now considering 1714/1900 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 664/731 places, 1714/1900 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 174165 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174165 steps, saw 113065 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:09:47] [INFO ] Flow matrix only has 1147 transitions (discarded 567 similar events)
// Phase 1: matrix 1147 rows 664 cols
[2023-03-12 14:09:47] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:09:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:09:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:09:47] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:09:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:09:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:09:49] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:49] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 14:09:49] [INFO ] After 638ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:50] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 1 ms to minimize.
[2023-03-12 14:09:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-12 14:09:50] [INFO ] After 1436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-12 14:09:50] [INFO ] After 2877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1714/1714 transitions.
Applied a total of 0 rules in 83 ms. Remains 664 /664 variables (removed 0) and now considering 1714/1714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 664/664 places, 1714/1714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1714/1714 transitions.
Applied a total of 0 rules in 85 ms. Remains 664 /664 variables (removed 0) and now considering 1714/1714 (removed 0) transitions.
[2023-03-12 14:09:51] [INFO ] Flow matrix only has 1147 transitions (discarded 567 similar events)
[2023-03-12 14:09:51] [INFO ] Invariant cache hit.
[2023-03-12 14:09:51] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 14:09:51] [INFO ] Flow matrix only has 1147 transitions (discarded 567 similar events)
[2023-03-12 14:09:51] [INFO ] Invariant cache hit.
[2023-03-12 14:09:51] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-12 14:09:53] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 2569 ms to find 0 implicit places.
[2023-03-12 14:09:53] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 14:09:53] [INFO ] Flow matrix only has 1147 transitions (discarded 567 similar events)
[2023-03-12 14:09:53] [INFO ] Invariant cache hit.
[2023-03-12 14:09:54] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3340 ms. Remains : 664/664 places, 1714/1714 transitions.
Graph (trivial) has 1014 edges and 664 vertex of which 192 / 664 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 439 transitions
Reduce isomorphic transitions removed 759 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 536 transition count 938
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 519 transition count 938
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 35 place count 519 transition count 849
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 213 place count 430 transition count 849
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 276 place count 367 transition count 786
Iterating global reduction 2 with 63 rules applied. Total rules applied 339 place count 367 transition count 786
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 465 place count 367 transition count 660
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 723 place count 238 transition count 531
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 787 place count 174 transition count 403
Iterating global reduction 3 with 64 rules applied. Total rules applied 851 place count 174 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 174 transition count 402
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 915 place count 111 transition count 276
Iterating global reduction 4 with 63 rules applied. Total rules applied 978 place count 111 transition count 276
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1041 place count 48 transition count 150
Iterating global reduction 4 with 63 rules applied. Total rules applied 1104 place count 48 transition count 150
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1167 place count 48 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1167 place count 48 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1169 place count 47 transition count 86
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 1171 place count 46 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1183 place count 40 transition count 85
Applied a total of 1183 rules in 70 ms. Remains 40 /664 variables (removed 624) and now considering 85/1714 (removed 1629) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 85 rows 40 cols
[2023-03-12 14:09:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:09:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:09:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:09:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:09:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:09:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:09:54] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:09:54] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:09:54] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-12 14:09:54] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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 704 ms. Remains 607 /731 variables (removed 124) and now considering 1590/1900 (removed 310) transitions.
[2023-03-12 14:09:55] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-12 14:09:55] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 14:09:55] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-12 14:09:55] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-12 14:09:55] [INFO ] Invariant cache hit.
[2023-03-12 14:09:56] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:09:57] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2023-03-12 14:09:57] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 14:09:57] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-12 14:09:57] [INFO ] Invariant cache hit.
[2023-03-12 14:09:58] [INFO ] Dead Transitions using invariants and state equation in 503 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 3283 ms. Remains : 607/731 places, 1590/1900 transitions.
Stuttering acceptance computed with spot in 220 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]]
Product exploration explored 100000 steps with 0 reset in 623 ms.
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 4183 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 437 ms. Remains 630 /731 variables (removed 101) and now considering 1642/1900 (removed 258) transitions.
[2023-03-12 14:09:59] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
// Phase 1: matrix 1098 rows 630 cols
[2023-03-12 14:09:59] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-12 14:09:59] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-12 14:09:59] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-12 14:09:59] [INFO ] Invariant cache hit.
[2023-03-12 14:10:00] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:10:01] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2023-03-12 14:10:01] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-12 14:10:01] [INFO ] Flow matrix only has 1098 transitions (discarded 544 similar events)
[2023-03-12 14:10:01] [INFO ] Invariant cache hit.
[2023-03-12 14:10:02] [INFO ] Dead Transitions using invariants and state equation in 613 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 3156 ms. Remains : 630/731 places, 1642/1900 transitions.
Stuttering acceptance computed with spot in 41 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 479 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-02 finished in 3709 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 250 ms. Remains 625 /731 variables (removed 106) and now considering 1638/1900 (removed 262) transitions.
[2023-03-12 14:10:02] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 625 cols
[2023-03-12 14:10:02] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:10:03] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-12 14:10:03] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-12 14:10:03] [INFO ] Invariant cache hit.
[2023-03-12 14:10:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:10:04] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2023-03-12 14:10:04] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2023-03-12 14:10:04] [INFO ] Invariant cache hit.
[2023-03-12 14:10:05] [INFO ] Dead Transitions using invariants and state equation in 605 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 2724 ms. Remains : 625/731 places, 1638/1900 transitions.
Stuttering acceptance computed with spot in 105 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 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-03 finished in 2853 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 426 ms. Remains 614 /731 variables (removed 117) and now considering 1604/1900 (removed 296) transitions.
[2023-03-12 14:10:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:10:05] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 14:10:06] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 14:10:06] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:06] [INFO ] Invariant cache hit.
[2023-03-12 14:10:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:07] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-12 14:10:08] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 14:10:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:08] [INFO ] Invariant cache hit.
[2023-03-12 14:10:08] [INFO ] Dead Transitions using invariants and state equation in 512 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 3092 ms. Remains : 614/731 places, 1604/1900 transitions.
Stuttering acceptance computed with spot in 80 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 1 reset in 453 ms.
Product exploration explored 100000 steps with 0 reset in 498 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 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 257146 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257146 steps, saw 166919 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:10:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:13] [INFO ] Invariant cache hit.
[2023-03-12 14:10:13] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:13] [INFO ] After 805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:14] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:14] [INFO ] After 366ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:15] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2023-03-12 14:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-12 14:10:15] [INFO ] After 1056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-12 14:10:16] [INFO ] After 2139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 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 85 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 86 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 255949 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255949 steps, saw 166142 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:10:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:19] [INFO ] Invariant cache hit.
[2023-03-12 14:10:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:20] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:20] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:21] [INFO ] After 369ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:21] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 1 ms to minimize.
[2023-03-12 14:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-12 14:10:21] [INFO ] After 1088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-12 14:10:22] [INFO ] After 2176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 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 78 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 79 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-12 14:10:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:22] [INFO ] Invariant cache hit.
[2023-03-12 14:10:22] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 14:10:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:22] [INFO ] Invariant cache hit.
[2023-03-12 14:10:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:24] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2023-03-12 14:10:24] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 14:10:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:24] [INFO ] Invariant cache hit.
[2023-03-12 14:10:25] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2765 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 31 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-12 14:10:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:10:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:10:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:25] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:10:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:25] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:10:25] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:25] [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-12 14:10:25] [INFO ] After 71ms 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 191 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 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 89 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:10:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:10:25] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:10:26] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 14:10:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:26] [INFO ] Invariant cache hit.
[2023-03-12 14:10:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:27] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
[2023-03-12 14:10:27] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 14:10:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:27] [INFO ] Invariant cache hit.
[2023-03-12 14:10:28] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2880 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 189 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 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 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 318780 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318780 steps, saw 206918 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:10:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:31] [INFO ] Invariant cache hit.
[2023-03-12 14:10:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:10:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:32] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:10:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:33] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:33] [INFO ] After 362ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:34] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2023-03-12 14:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-12 14:10:34] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-12 14:10:34] [INFO ] After 2084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10005 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 17 ms. (steps per millisecond=588 ) 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
Interrupted probabilistic random walk after 285405 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 285405 steps, saw 185259 distinct states, run finished after 3003 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:10:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:38] [INFO ] Invariant cache hit.
[2023-03-12 14:10:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:38] [INFO ] After 808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:39] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:39] [INFO ] After 358ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:40] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-12 14:10:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-12 14:10:40] [INFO ] After 1022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-12 14:10:40] [INFO ] After 2054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 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 87 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 87 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 78 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:10:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:41] [INFO ] Invariant cache hit.
[2023-03-12 14:10:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 14:10:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:41] [INFO ] Invariant cache hit.
[2023-03-12 14:10:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:42] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
[2023-03-12 14:10:43] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 14:10:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:43] [INFO ] Invariant cache hit.
[2023-03-12 14:10:43] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2500 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 37 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-12 14:10:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:10:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:10:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:43] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:10:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:43] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:10:43] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:43] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 14:10:43] [INFO ] After 68ms 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 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 515 ms.
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-12 14:10:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:10:45] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 14:10:45] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 14:10:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:45] [INFO ] Invariant cache hit.
[2023-03-12 14:10:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:10:46] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-12 14:10:47] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 14:10:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:10:47] [INFO ] Invariant cache hit.
[2023-03-12 14:10:47] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2505 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 42283 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 374 ms. Remains 628 /731 variables (removed 103) and now considering 1634/1900 (removed 266) transitions.
[2023-03-12 14:10:48] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-12 14:10:48] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:10:48] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-12 14:10:48] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:10:48] [INFO ] Invariant cache hit.
[2023-03-12 14:10:48] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:10:50] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-12 14:10:50] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:10:50] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:10:50] [INFO ] Invariant cache hit.
[2023-03-12 14:10:50] [INFO ] Dead Transitions using invariants and state equation in 521 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 3010 ms. Remains : 628/731 places, 1634/1900 transitions.
Stuttering acceptance computed with spot in 69 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 426 ms.
Product exploration explored 100000 steps with 0 reset in 557 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 189 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) 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 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 312168 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312168 steps, saw 202630 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:10:55] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:10:55] [INFO ] Invariant cache hit.
[2023-03-12 14:10:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:10:55] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:10:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:10:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:10:56] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:56] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:10:56] [INFO ] After 383ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:10:57] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-12 14:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-12 14:10:57] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-12 14:10:57] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 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 81 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 82 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 252176 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252176 steps, saw 163693 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:11:00] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:00] [INFO ] Invariant cache hit.
[2023-03-12 14:11:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:01] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:11:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:01] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:01] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:02] [INFO ] After 384ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:02] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2023-03-12 14:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-12 14:11:02] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-12 14:11:02] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 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 76 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 76 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 80 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-12 14:11:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:03] [INFO ] Invariant cache hit.
[2023-03-12 14:11:03] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 14:11:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:03] [INFO ] Invariant cache hit.
[2023-03-12 14:11:03] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:04] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-12 14:11:04] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:11:04] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:04] [INFO ] Invariant cache hit.
[2023-03-12 14:11:05] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 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 1 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 31 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-12 14:11:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:11:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:11:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:05] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:11:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:05] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:11:05] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:05] [INFO ] After 17ms 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-12 14:11:05] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 208 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 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 89 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-12 14:11:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-12 14:11:05] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:11:06] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 14:11:06] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:06] [INFO ] Invariant cache hit.
[2023-03-12 14:11:06] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:07] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-12 14:11:07] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:11:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:07] [INFO ] Invariant cache hit.
[2023-03-12 14:11:08] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2533 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 199 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 271251 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271251 steps, saw 176073 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:11:11] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:11] [INFO ] Invariant cache hit.
[2023-03-12 14:11:11] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:11:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:12] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:13] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:13] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:13] [INFO ] After 381ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:13] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2023-03-12 14:11:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-12 14:11:13] [INFO ] After 896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-12 14:11:14] [INFO ] After 1743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 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 82 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 83 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 318916 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318916 steps, saw 207008 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:11:17] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:17] [INFO ] Invariant cache hit.
[2023-03-12 14:11:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:17] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 14:11:18] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:18] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:18] [INFO ] After 382ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:19] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 1 ms to minimize.
[2023-03-12 14:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-12 14:11:19] [INFO ] After 898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-12 14:11:19] [INFO ] After 1731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 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 84 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 85 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 74 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-12 14:11:19] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:19] [INFO ] Invariant cache hit.
[2023-03-12 14:11:20] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 14:11:20] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:20] [INFO ] Invariant cache hit.
[2023-03-12 14:11:20] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:21] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2023-03-12 14:11:21] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:11:21] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:21] [INFO ] Invariant cache hit.
[2023-03-12 14:11:21] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2350 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 38 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2023-03-12 14:11:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:11:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:11:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:22] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:11:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:22] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:11:22] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:22] [INFO ] After 17ms 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-12 14:11:22] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 241 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Product exploration explored 100000 steps with 1 reset in 583 ms.
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 81 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-12 14:11:23] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2023-03-12 14:11:23] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:11:24] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-12 14:11:24] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:24] [INFO ] Invariant cache hit.
[2023-03-12 14:11:24] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-12 14:11:25] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
[2023-03-12 14:11:25] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 14:11:25] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2023-03-12 14:11:25] [INFO ] Invariant cache hit.
[2023-03-12 14:11:26] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2809 ms. Remains : 628/628 places, 1634/1634 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 38879 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 434 ms. Remains 629 /731 variables (removed 102) and now considering 1640/1900 (removed 260) transitions.
[2023-03-12 14:11:27] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-12 14:11:27] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:11:27] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 14:11:27] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:27] [INFO ] Invariant cache hit.
[2023-03-12 14:11:27] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:28] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2023-03-12 14:11:28] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:11:28] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:28] [INFO ] Invariant cache hit.
[2023-03-12 14:11:29] [INFO ] Dead Transitions using invariants and state equation in 531 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 2805 ms. Remains : 629/731 places, 1640/1900 transitions.
Stuttering acceptance computed with spot in 158 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 2 reset in 441 ms.
Product exploration explored 100000 steps with 2 reset in 549 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 527 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 156 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 114 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 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 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 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 232716 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232716 steps, saw 151063 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:11:34] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:34] [INFO ] Invariant cache hit.
[2023-03-12 14:11:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:34] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:11:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:11:36] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:11:36] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:36] [INFO ] After 846ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:11:37] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2023-03-12 14:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-12 14:11:37] [INFO ] After 1776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 443 ms.
[2023-03-12 14:11:38] [INFO ] After 3303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 11 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 148 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 148 ms. Remains : 629/629 places, 1638/1640 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) 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 3) seen :1
Running SMT prover for 2 properties.
[2023-03-12 14:11:38] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
// Phase 1: matrix 1096 rows 629 cols
[2023-03-12 14:11:38] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 14:11:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:39] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:39] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:40] [INFO ] After 348ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:40] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-12 14:11:40] [INFO ] After 1267ms 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 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 204 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 204 ms. Remains : 621/629 places, 1620/1638 transitions.
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 20 ms. (steps per millisecond=500 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 328211 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328211 steps, saw 213041 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:11:43] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
// Phase 1: matrix 1083 rows 621 cols
[2023-03-12 14:11:43] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:11:43] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:44] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:11:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:44] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:11:45] [INFO ] After 387ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:45] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-12 14:11:45] [INFO ] After 1474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 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 73 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 73 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 76 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2023-03-12 14:11:45] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:11:45] [INFO ] Invariant cache hit.
[2023-03-12 14:11:46] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 14:11:46] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:11:46] [INFO ] Invariant cache hit.
[2023-03-12 14:11:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:11:47] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-03-12 14:11:47] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 14:11:47] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:11:47] [INFO ] Invariant cache hit.
[2023-03-12 14:11:48] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2358 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 32 ms. Remains 24 /621 variables (removed 597) and now considering 42/1620 (removed 1578) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-12 14:11:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:11:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:11:48] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:11:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:48] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:11:48] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:48] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 14:11:48] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 p2), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 601 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 163 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-12 14:11:49] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-12 14:11:49] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:11:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:51] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2023-03-12 14:11:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:11:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2023-03-12 14:11:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:11:53] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-12 14:11:53] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:53] [INFO ] [Nat]Added 271 Read/Feed constraints in 102 ms returned sat
[2023-03-12 14:11:53] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 204 ms.
[2023-03-12 14:11:53] [INFO ] Added : 20 causal constraints over 5 iterations in 656 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 87 ms. Remains 629 /629 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2023-03-12 14:11:53] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:53] [INFO ] Invariant cache hit.
[2023-03-12 14:11:54] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 14:11:54] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:54] [INFO ] Invariant cache hit.
[2023-03-12 14:11:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:55] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2023-03-12 14:11:55] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 14:11:55] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:55] [INFO ] Invariant cache hit.
[2023-03-12 14:11:56] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2354 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 540 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 150 ms :[(NOT p2), p0, (OR p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) 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 :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 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 :1
Running SMT prover for 2 properties.
[2023-03-12 14:11:57] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:11:57] [INFO ] Invariant cache hit.
[2023-03-12 14:11:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:57] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:11:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:11:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:11:58] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:58] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:11:58] [INFO ] After 345ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:11:59] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 1 ms to minimize.
[2023-03-12 14:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-12 14:11:59] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-12 14:11:59] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 276 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 276 ms. Remains : 621/629 places, 1620/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 344437 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344437 steps, saw 223571 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:12:02] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
// Phase 1: matrix 1083 rows 621 cols
[2023-03-12 14:12:02] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:12:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:12:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:12:03] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:12:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:12:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:12:04] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:12:04] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:12:04] [INFO ] After 371ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:12:04] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-12 14:12:04] [INFO ] After 1434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 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 72 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 72 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 73 ms. Remains 621 /621 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2023-03-12 14:12:05] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:12:05] [INFO ] Invariant cache hit.
[2023-03-12 14:12:05] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 14:12:05] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:12:05] [INFO ] Invariant cache hit.
[2023-03-12 14:12:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:12:06] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2023-03-12 14:12:06] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 14:12:06] [INFO ] Flow matrix only has 1083 transitions (discarded 537 similar events)
[2023-03-12 14:12:06] [INFO ] Invariant cache hit.
[2023-03-12 14:12:07] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2353 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 1 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 31 ms. Remains 24 /621 variables (removed 597) and now considering 42/1620 (removed 1578) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-12 14:12:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:12:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:12:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:12:07] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:12:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:12:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:12:07] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:12:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:12:07] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:12:07] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 14:12:07] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 p2), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 587 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 153 ms :[(NOT p2), p0, (OR p0 p1), p1]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), p0, (OR p0 p1), p1]
[2023-03-12 14:12:08] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
// Phase 1: matrix 1097 rows 629 cols
[2023-03-12 14:12:08] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:12:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 14:12:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:10] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2023-03-12 14:12:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:12:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-12 14:12:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:12:12] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2023-03-12 14:12:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:12:12] [INFO ] [Nat]Added 271 Read/Feed constraints in 104 ms returned sat
[2023-03-12 14:12:12] [INFO ] Computed and/alt/rep : 212/328/212 causal constraints (skipped 883 transitions) in 105 ms.
[2023-03-12 14:12:12] [INFO ] Added : 20 causal constraints over 5 iterations in 532 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), p0, (OR p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 476 ms.
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-12 14:12:13] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:12:13] [INFO ] Invariant cache hit.
[2023-03-12 14:12:14] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-12 14:12:14] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:12:14] [INFO ] Invariant cache hit.
[2023-03-12 14:12:14] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:12:15] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2023-03-12 14:12:15] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 14:12:15] [INFO ] Flow matrix only has 1097 transitions (discarded 543 similar events)
[2023-03-12 14:12:15] [INFO ] Invariant cache hit.
[2023-03-12 14:12:16] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2382 ms. Remains : 629/629 places, 1640/1640 transitions.
Treatment of property FunctionPointer-PT-c008-LTLFireability-14 finished in 49745 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)))))'
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))'
[2023-03-12 14:12:16] [INFO ] Flatten gal took : 88 ms
[2023-03-12 14:12:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 14:12:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 731 places, 1900 transitions and 7726 arcs took 18 ms.
Total runtime 163216 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1537/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1537/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1537/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-c008-LTLFireability-09
Could not compute solution for formula : FunctionPointer-PT-c008-LTLFireability-13
Could not compute solution for formula : FunctionPointer-PT-c008-LTLFireability-14

BK_STOP 1678630339711

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-c008-LTLFireability-09
ltl formula formula --ltl=/tmp/1537/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 731 places, 1900 transitions and 7726 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.070 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FunctionPointer-PT-c008-LTLFireability-13
ltl formula formula --ltl=/tmp/1537/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 731 places, 1900 transitions and 7726 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.030 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x556c724fb3f4]
1: pnml2lts-mc(+0xa2496) [0x556c724fb496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f28d183f140]
3: pnml2lts-mc(+0x405be5) [0x556c7285ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x556c725c43f9]
5: pnml2lts-mc(+0x164ac4) [0x556c725bdac4]
6: pnml2lts-mc(+0x272e0a) [0x556c726cbe0a]
7: pnml2lts-mc(+0xb61f0) [0x556c7250f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f28d16924d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f28d169267a]
10: pnml2lts-mc(+0xa1581) [0x556c724fa581]
11: pnml2lts-mc(+0xa1910) [0x556c724fa910]
12: pnml2lts-mc(+0xa32a2) [0x556c724fc2a2]
13: pnml2lts-mc(+0xa50f4) [0x556c724fe0f4]
14: pnml2lts-mc(+0xa516b) [0x556c724fe16b]
15: pnml2lts-mc(+0x3f34b3) [0x556c7284c4b3]
16: pnml2lts-mc(+0x7c63d) [0x556c724d563d]
17: pnml2lts-mc(+0x67d86) [0x556c724c0d86]
18: pnml2lts-mc(+0x60a8a) [0x556c724b9a8a]
19: pnml2lts-mc(+0x5eb15) [0x556c724b7b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f28d167ad0a]
21: pnml2lts-mc(+0x6075e) [0x556c724b975e]
ltl formula name FunctionPointer-PT-c008-LTLFireability-14
ltl formula formula --ltl=/tmp/1537/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 731 places, 1900 transitions and 7726 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1537/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1537/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1537/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1537/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r169-tall-167838856300732"
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 ;