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.r521-tall-167987246400251.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 EisenbergMcGuire-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 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 EisenbergMcGuire-PT-07-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680842046903

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:34:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 04:34:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:34:08] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-04-07 04:34:08] [INFO ] Transformed 553 places.
[2023-04-07 04:34:08] [INFO ] Transformed 1960 transitions.
[2023-04-07 04:34:08] [INFO ] Found NUPN structural information;
[2023-04-07 04:34:08] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 515 transition count 1694
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 515 transition count 1694
Applied a total of 76 rules in 154 ms. Remains 515 /553 variables (removed 38) and now considering 1694/1960 (removed 266) transitions.
[2023-04-07 04:34:09] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
// Phase 1: matrix 735 rows 515 cols
[2023-04-07 04:34:09] [INFO ] Computed 22 invariants in 24 ms
[2023-04-07 04:34:10] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-04-07 04:34:10] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:34:10] [INFO ] Invariant cache hit.
[2023-04-07 04:34:10] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 04:34:12] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
[2023-04-07 04:34:12] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:34:12] [INFO ] Invariant cache hit.
[2023-04-07 04:34:13] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 515/553 places, 1694/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3858 ms. Remains : 515/553 places, 1694/1960 transitions.
Support contains 30 out of 515 places after structural reductions.
[2023-04-07 04:34:13] [INFO ] Flatten gal took : 132 ms
[2023-04-07 04:34:13] [INFO ] Flatten gal took : 78 ms
[2023-04-07 04:34:13] [INFO ] Input system was already deterministic with 1694 transitions.
Support contains 29 out of 515 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:34:14] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:34:14] [INFO ] Invariant cache hit.
[2023-04-07 04:34:14] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:34:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-04-07 04:34:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:34:14] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:34:14] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 04:34:15] [INFO ] After 176ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:34:15] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 16 ms to minimize.
[2023-04-07 04:34:15] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2023-04-07 04:34:15] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 1 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 1 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 0 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 04:34:17] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2023-04-07 04:34:17] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-04-07 04:34:17] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2023-04-07 04:34:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2395 ms
[2023-04-07 04:34:17] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-04-07 04:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-07 04:34:17] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 1 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 1 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 0 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2023-04-07 04:34:18] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:34:19] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-07 04:34:19] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-04-07 04:34:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1502 ms
[2023-04-07 04:34:19] [INFO ] After 4328ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-04-07 04:34:19] [INFO ] After 5013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 508 transition count 1536
Deduced a syphon composed of 151 places in 14 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 357 transition count 1536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 318 place count 355 transition count 1522
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 355 transition count 1522
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 313 transition count 1480
Applied a total of 404 rules in 307 ms. Remains 313 /515 variables (removed 202) and now considering 1480/1694 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 313/515 places, 1480/1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 380432 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380432 steps, saw 147653 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:34:22] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
// Phase 1: matrix 521 rows 313 cols
[2023-04-07 04:34:22] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:34:22] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:34:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:23] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:34:23] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:23] [INFO ] After 87ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-04-07 04:34:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 478 ms
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2023-04-07 04:34:23] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:34:24] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-04-07 04:34:24] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:34:24] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 04:34:24] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:34:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 690 ms
[2023-04-07 04:34:24] [INFO ] After 1301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 04:34:24] [INFO ] After 1589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 transitions.
Applied a total of 0 rules in 58 ms. Remains 313 /313 variables (removed 0) and now considering 1480/1480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 313/313 places, 1480/1480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 transitions.
Applied a total of 0 rules in 100 ms. Remains 313 /313 variables (removed 0) and now considering 1480/1480 (removed 0) transitions.
[2023-04-07 04:34:24] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-07 04:34:24] [INFO ] Invariant cache hit.
[2023-04-07 04:34:24] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-04-07 04:34:24] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-07 04:34:24] [INFO ] Invariant cache hit.
[2023-04-07 04:34:25] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:26] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-04-07 04:34:26] [INFO ] Redundant transitions in 87 ms returned []
[2023-04-07 04:34:26] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-07 04:34:26] [INFO ] Invariant cache hit.
[2023-04-07 04:34:26] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2049 ms. Remains : 313/313 places, 1480/1480 transitions.
Graph (trivial) has 1333 edges and 313 vertex of which 47 / 313 are part of one of the 7 SCC in 2 ms
Free SCC test removed 40 places
Drop transitions removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 273 transition count 333
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 211 transition count 333
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 211 transition count 319
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 191 transition count 319
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 317 place count 112 transition count 240
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 356 place count 112 transition count 201
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 376 place count 102 transition count 245
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 388 place count 102 transition count 233
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 401 place count 102 transition count 220
Free-agglomeration rule applied 30 times.
Iterating global reduction 4 with 30 rules applied. Total rules applied 431 place count 102 transition count 190
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 461 place count 72 transition count 190
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 473 place count 72 transition count 190
Applied a total of 473 rules in 40 ms. Remains 72 /313 variables (removed 241) and now considering 190/1480 (removed 1290) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 72 cols
[2023-04-07 04:34:26] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 04:34:26] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:34:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:34:26] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 04:34:26] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:34:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:34:26] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 4 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-04-07 04:34:26] [INFO ] After 137ms 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-04-07 04:34:26] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 1680
Applied a total of 4 rules in 17 ms. Remains 513 /515 variables (removed 2) and now considering 1680/1694 (removed 14) transitions.
[2023-04-07 04:34:27] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2023-04-07 04:34:27] [INFO ] Computed 22 invariants in 10 ms
[2023-04-07 04:34:27] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-04-07 04:34:27] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-07 04:34:27] [INFO ] Invariant cache hit.
[2023-04-07 04:34:27] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:29] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
[2023-04-07 04:34:29] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-07 04:34:29] [INFO ] Invariant cache hit.
[2023-04-07 04:34:29] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/515 places, 1680/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2741 ms. Remains : 513/515 places, 1680/1694 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s276 0) (EQ s70 1)), p1:(OR (EQ s187 0) (EQ s133 1) (EQ s134 0) (EQ s389 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 0 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :1
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 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:34:31] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-07 04:34:31] [INFO ] Invariant cache hit.
[2023-04-07 04:34:31] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:34:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:34:31] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:34:31] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 04:34:31] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:31] [INFO ] After 89ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 04:34:32] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 1 ms to minimize.
[2023-04-07 04:34:32] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 0 ms to minimize.
[2023-04-07 04:34:32] [INFO ] Deduced a trap composed of 95 places in 194 ms of which 0 ms to minimize.
[2023-04-07 04:34:32] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-04-07 04:34:32] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-04-07 04:34:33] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-04-07 04:34:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1219 ms
[2023-04-07 04:34:33] [INFO ] After 1336ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 04:34:33] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 506 transition count 1520
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 353 transition count 1520
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 311 transition count 1478
Applied a total of 404 rules in 102 ms. Remains 311 /513 variables (removed 202) and now considering 1478/1680 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 311/513 places, 1478/1680 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 708480 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 708480 steps, saw 236165 distinct states, run finished after 3004 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:34:36] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-07 04:34:36] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:34:36] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:36] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:36] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:36] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:36] [INFO ] After 50ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:36] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 04:34:36] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2023-04-07 04:34:36] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-04-07 04:34:37] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:34:37] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-04-07 04:34:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 588 ms
[2023-04-07 04:34:37] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 04:34:37] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 97 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 70 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-07 04:34:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:37] [INFO ] Invariant cache hit.
[2023-04-07 04:34:37] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-04-07 04:34:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:37] [INFO ] Invariant cache hit.
[2023-04-07 04:34:38] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:38] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2023-04-07 04:34:39] [INFO ] Redundant transitions in 66 ms returned []
[2023-04-07 04:34:39] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:39] [INFO ] Invariant cache hit.
[2023-04-07 04:34:39] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2126 ms. Remains : 311/311 places, 1478/1478 transitions.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 25 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2023-04-07 04:34:39] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 04:34:39] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:34:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 04:34:39] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:34:39] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:39] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:34:39] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 398 place count 314 transition count 1481
Applied a total of 398 rules in 100 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2023-04-07 04:34:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-07 04:34:40] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:34:40] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-04-07 04:34:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:34:40] [INFO ] Invariant cache hit.
[2023-04-07 04:34:40] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:41] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2023-04-07 04:34:41] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:34:41] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:34:41] [INFO ] Invariant cache hit.
[2023-04-07 04:34:42] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/513 places, 1481/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2115 ms. Remains : 314/513 places, 1481/1680 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :1
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 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:34:42] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:34:42] [INFO ] Invariant cache hit.
[2023-04-07 04:34:42] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:34:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:42] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:42] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 04:34:42] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:42] [INFO ] After 47ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 7 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1118 ms
[2023-04-07 04:34:43] [INFO ] After 1181ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 04:34:43] [INFO ] After 1399ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
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 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 42 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 311/314 places, 1478/1481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 739776 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 739776 steps, saw 232250 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:34:46] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-07 04:34:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:34:46] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:47] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:47] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:47] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:47] [INFO ] After 72ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:34:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 654 ms
[2023-04-07 04:34:47] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 04:34:47] [INFO ] After 948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 30 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 29 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-07 04:34:47] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:47] [INFO ] Invariant cache hit.
[2023-04-07 04:34:48] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-04-07 04:34:48] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:48] [INFO ] Invariant cache hit.
[2023-04-07 04:34:48] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:49] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-04-07 04:34:49] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-07 04:34:49] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:34:49] [INFO ] Invariant cache hit.
[2023-04-07 04:34:49] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1776 ms. Remains : 311/311 places, 1478/1478 transitions.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 27 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2023-04-07 04:34:49] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 04:34:49] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:34:49] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 04:34:49] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:34:49] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:49] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 04:34:49] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 31 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-07 04:34:50] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-07 04:34:50] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:34:51] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-04-07 04:34:51] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:34:51] [INFO ] Invariant cache hit.
[2023-04-07 04:34:51] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:34:51] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-04-07 04:34:52] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-07 04:34:52] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:34:52] [INFO ] Invariant cache hit.
[2023-04-07 04:34:52] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1848 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 25511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 508 transition count 1534
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 355 transition count 1534
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 324 place count 351 transition count 1506
Iterating global reduction 2 with 4 rules applied. Total rules applied 328 place count 351 transition count 1506
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 410 place count 310 transition count 1465
Applied a total of 410 rules in 66 ms. Remains 310 /515 variables (removed 205) and now considering 1465/1694 (removed 229) transitions.
[2023-04-07 04:34:52] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2023-04-07 04:34:52] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:34:53] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-04-07 04:34:53] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-07 04:34:53] [INFO ] Invariant cache hit.
[2023-04-07 04:34:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:34:54] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2023-04-07 04:34:54] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:34:54] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-07 04:34:54] [INFO ] Invariant cache hit.
[2023-04-07 04:34:54] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/515 places, 1465/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2025 ms. Remains : 310/515 places, 1465/1694 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s92 0) (NEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25 reset in 208 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-01 finished in 2342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 15 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:34:55] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:34:55] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:34:55] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 04:34:55] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:34:55] [INFO ] Invariant cache hit.
[2023-04-07 04:34:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:34:57] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-04-07 04:34:57] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:34:57] [INFO ] Invariant cache hit.
[2023-04-07 04:34:57] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2637 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s23 0) (EQ s54 1)), p0:(OR (EQ s139 0) (EQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 606 ms.
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 31 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-02 finished in 4073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 13 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:34:59] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:34:59] [INFO ] Invariant cache hit.
[2023-04-07 04:34:59] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-04-07 04:34:59] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:34:59] [INFO ] Invariant cache hit.
[2023-04-07 04:34:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:01] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-04-07 04:35:01] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:01] [INFO ] Invariant cache hit.
[2023-04-07 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2601 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s157 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Product exploration explored 100000 steps with 50000 reset in 583 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-05 finished in 3890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 14 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:35:03] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:03] [INFO ] Invariant cache hit.
[2023-04-07 04:35:03] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-04-07 04:35:03] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:03] [INFO ] Invariant cache hit.
[2023-04-07 04:35:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:04] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-04-07 04:35:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:04] [INFO ] Invariant cache hit.
[2023-04-07 04:35:05] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s483 0) (EQ s178 1) (EQ s309 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 580 ms.
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-08 finished in 3721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(!p0))))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 17 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:35:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:06] [INFO ] Invariant cache hit.
[2023-04-07 04:35:07] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-04-07 04:35:07] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:07] [INFO ] Invariant cache hit.
[2023-04-07 04:35:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:08] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2023-04-07 04:35:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:08] [INFO ] Invariant cache hit.
[2023-04-07 04:35:09] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2525 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, true, (NOT p0), p0, (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s387 0) (EQ s484 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 413 reset in 218 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-10 finished in 2928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 26 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:35:09] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:09] [INFO ] Invariant cache hit.
[2023-04-07 04:35:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-04-07 04:35:10] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:10] [INFO ] Invariant cache hit.
[2023-04-07 04:35:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:11] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2023-04-07 04:35:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:35:11] [INFO ] Invariant cache hit.
[2023-04-07 04:35:12] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2571 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s71 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 177 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-12 finished in 2668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 16 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 04:35:12] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 04:35:12] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 04:35:12] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-04-07 04:35:12] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:35:12] [INFO ] Invariant cache hit.
[2023-04-07 04:35:12] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:35:14] [INFO ] Implicit Places using invariants and state equation in 1984 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2023-04-07 04:35:14] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:35:14] [INFO ] Invariant cache hit.
[2023-04-07 04:35:15] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2917 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s233 0) (EQ s287 1)), p0:(AND (NEQ s106 0) (NEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 131 reset in 218 ms.
Stack based approach found an accepted trace after 794 steps with 1 reset with depth 67 and stack size 67 in 3 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-13 finished in 3223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 325 place count 351 transition count 1512
Iterating global reduction 2 with 3 rules applied. Total rules applied 328 place count 351 transition count 1512
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 412 place count 309 transition count 1470
Applied a total of 412 rules in 66 ms. Remains 309 /515 variables (removed 206) and now considering 1470/1694 (removed 224) transitions.
[2023-04-07 04:35:15] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
// Phase 1: matrix 511 rows 309 cols
[2023-04-07 04:35:15] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:35:15] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-04-07 04:35:15] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2023-04-07 04:35:15] [INFO ] Invariant cache hit.
[2023-04-07 04:35:16] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:35:16] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-04-07 04:35:16] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:35:16] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2023-04-07 04:35:16] [INFO ] Invariant cache hit.
[2023-04-07 04:35:17] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 309/515 places, 1470/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1787 ms. Remains : 309/515 places, 1470/1694 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s294 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-14 finished in 2022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 414 place count 308 transition count 1463
Applied a total of 414 rules in 59 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-07 04:35:17] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:35:17] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:35:18] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-04-07 04:35:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:18] [INFO ] Invariant cache hit.
[2023-04-07 04:35:18] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:19] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-04-07 04:35:19] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:35:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:19] [INFO ] Invariant cache hit.
[2023-04-07 04:35:19] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/515 places, 1463/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1931 ms. Remains : 308/515 places, 1463/1694 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 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 190 reset in 175 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-15 finished in 2154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLCardinality-00
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 508 transition count 1536
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 357 transition count 1536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 318 place count 355 transition count 1522
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 402 place count 314 transition count 1481
Applied a total of 402 rules in 50 ms. Remains 314 /515 variables (removed 201) and now considering 1481/1694 (removed 213) transitions.
[2023-04-07 04:35:20] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-07 04:35:20] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:35:20] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 04:35:20] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:20] [INFO ] Invariant cache hit.
[2023-04-07 04:35:20] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:21] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2023-04-07 04:35:21] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:21] [INFO ] Invariant cache hit.
[2023-04-07 04:35:21] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 314/515 places, 1481/1694 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1765 ms. Remains : 314/515 places, 1481/1694 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s144 0) (EQ s70 1)), p1:(OR (EQ s105 0) (EQ s92 1) (EQ s93 0) (EQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :1
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 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:35:22] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:22] [INFO ] Invariant cache hit.
[2023-04-07 04:35:22] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:35:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:35:22] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 04:35:22] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:22] [INFO ] After 64ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 04:35:22] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:35:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 758 ms
[2023-04-07 04:35:23] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 04:35:23] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 49 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 311/314 places, 1478/1481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 742072 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 742072 steps, saw 233182 distinct states, run finished after 3002 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:35:26] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-07 04:35:26] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:35:26] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:26] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:26] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:26] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:26] [INFO ] After 49ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:35:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 767 ms
[2023-04-07 04:35:27] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 04:35:27] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 33 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 28 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-07 04:35:27] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:27] [INFO ] Invariant cache hit.
[2023-04-07 04:35:28] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-04-07 04:35:28] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:28] [INFO ] Invariant cache hit.
[2023-04-07 04:35:28] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:29] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2023-04-07 04:35:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-07 04:35:29] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:29] [INFO ] Invariant cache hit.
[2023-04-07 04:35:29] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1715 ms. Remains : 311/311 places, 1478/1478 transitions.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 17 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2023-04-07 04:35:29] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 04:35:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:35:29] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 04:35:29] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:35:29] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:29] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 04:35:29] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 34 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-07 04:35:29] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-07 04:35:29] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:35:30] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-04-07 04:35:30] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:30] [INFO ] Invariant cache hit.
[2023-04-07 04:35:30] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:31] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2023-04-07 04:35:31] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 04:35:31] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:31] [INFO ] Invariant cache hit.
[2023-04-07 04:35:31] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1853 ms. Remains : 314/314 places, 1481/1481 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:35:32] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:32] [INFO ] Invariant cache hit.
[2023-04-07 04:35:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:35:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:32] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:32] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 04:35:32] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:32] [INFO ] After 51ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 04:35:32] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-07 04:35:32] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-04-07 04:35:32] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-07 04:35:32] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:35:32] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-04-07 04:35:33] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:35:33] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:35:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 784 ms
[2023-04-07 04:35:33] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 04:35:33] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 314 transition count 1479
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 54 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 311/314 places, 1478/1481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 742288 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 742288 steps, saw 233315 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:35:36] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-07 04:35:36] [INFO ] Computed 22 invariants in 10 ms
[2023-04-07 04:35:36] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-07 04:35:36] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:36] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:36] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:36] [INFO ] After 51ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:36] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2023-04-07 04:35:36] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2023-04-07 04:35:36] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:35:37] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:35:37] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-07 04:35:37] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-04-07 04:35:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:35:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 773 ms
[2023-04-07 04:35:37] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 04:35:37] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 31 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 29 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-07 04:35:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:37] [INFO ] Invariant cache hit.
[2023-04-07 04:35:37] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-04-07 04:35:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:37] [INFO ] Invariant cache hit.
[2023-04-07 04:35:37] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:38] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-04-07 04:35:38] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 04:35:38] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-07 04:35:38] [INFO ] Invariant cache hit.
[2023-04-07 04:35:39] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1853 ms. Remains : 311/311 places, 1478/1478 transitions.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 21 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2023-04-07 04:35:39] [INFO ] Computed 16 invariants in 0 ms
[2023-04-07 04:35:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:35:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 9 ms returned sat
[2023-04-07 04:35:39] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:35:39] [INFO ] After 29ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:39] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:35:39] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 29 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-07 04:35:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-07 04:35:40] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:35:40] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-04-07 04:35:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:40] [INFO ] Invariant cache hit.
[2023-04-07 04:35:40] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-07 04:35:41] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-04-07 04:35:41] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:35:41] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-07 04:35:41] [INFO ] Invariant cache hit.
[2023-04-07 04:35:42] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1808 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 22541 ms.
[2023-04-07 04:35:42] [INFO ] Flatten gal took : 93 ms
[2023-04-07 04:35:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-07 04:35:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 1694 transitions and 8148 arcs took 25 ms.
Total runtime 93701 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1484/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLCardinality-00

BK_STOP 1680842144029

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name EisenbergMcGuire-PT-07-LTLCardinality-00
ltl formula formula --ltl=/tmp/1484/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 515 places, 1694 transitions and 8148 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.070 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1484/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1484/ltl_0_
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
*** 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

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="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="LTLCardinality"
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 EisenbergMcGuire-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;