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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:13:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 22:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:13:15] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-04-06 22:13:15] [INFO ] Transformed 553 places.
[2023-04-06 22:13:15] [INFO ] Transformed 1960 transitions.
[2023-04-06 22:13:15] [INFO ] Found NUPN structural information;
[2023-04-06 22:13:15] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 204 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 88 ms. Remains 515 /553 variables (removed 38) and now considering 1694/1960 (removed 266) transitions.
[2023-04-06 22:13:16] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
// Phase 1: matrix 735 rows 515 cols
[2023-04-06 22:13:16] [INFO ] Computed 22 invariants in 24 ms
[2023-04-06 22:13:16] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-04-06 22:13:16] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:13:16] [INFO ] Invariant cache hit.
[2023-04-06 22:13:16] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-06 22:13:18] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2023-04-06 22:13:18] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:13:18] [INFO ] Invariant cache hit.
[2023-04-06 22:13:18] [INFO ] Dead Transitions using invariants and state equation in 516 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 2848 ms. Remains : 515/553 places, 1694/1960 transitions.
Support contains 30 out of 515 places after structural reductions.
[2023-04-06 22:13:19] [INFO ] Flatten gal took : 151 ms
[2023-04-06 22:13:19] [INFO ] Flatten gal took : 85 ms
[2023-04-06 22:13:19] [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 267 ms. (steps per millisecond=37 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
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 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:13:19] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:13:19] [INFO ] Invariant cache hit.
[2023-04-06 22:13:20] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:13:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-06 22:13:20] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:13:20] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:13:20] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-06 22:13:20] [INFO ] After 216ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:13:20] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 13 ms to minimize.
[2023-04-06 22:13:21] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 0 ms to minimize.
[2023-04-06 22:13:21] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 2 ms to minimize.
[2023-04-06 22:13:21] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 0 ms to minimize.
[2023-04-06 22:13:21] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2023-04-06 22:13:21] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1946 ms
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 22:13:22] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:13:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1205 ms
[2023-04-06 22:13:23] [INFO ] After 3582ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-04-06 22:13:24] [INFO ] After 4075ms 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 24 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 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 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 169 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 169 ms. Remains : 313/515 places, 1480/1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 496992 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 496992 steps, saw 182272 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:13:27] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
// Phase 1: matrix 521 rows 313 cols
[2023-04-06 22:13:27] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:13:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:13:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:13:27] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:13:27] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:13:27] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:27] [INFO ] After 76ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:13:27] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:13:27] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 357 ms
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:13:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 579 ms
[2023-04-06 22:13:28] [INFO ] After 1050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 22:13:28] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 44 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 44 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 49 ms. Remains 313 /313 variables (removed 0) and now considering 1480/1480 (removed 0) transitions.
[2023-04-06 22:13:28] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-06 22:13:28] [INFO ] Invariant cache hit.
[2023-04-06 22:13:29] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-04-06 22:13:29] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-06 22:13:29] [INFO ] Invariant cache hit.
[2023-04-06 22:13:29] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:30] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
[2023-04-06 22:13:30] [INFO ] Redundant transitions in 84 ms returned []
[2023-04-06 22:13:30] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2023-04-06 22:13:30] [INFO ] Invariant cache hit.
[2023-04-06 22:13:30] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1921 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 3 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 0 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 37 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-06 22:13:30] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:13:30] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:13:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:13:30] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:13:31] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:13:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:13:31] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:13:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-04-06 22:13:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 4 ms to minimize.
[2023-04-06 22:13:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-04-06 22:13:31] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-06 22:13:31] [INFO ] After 174ms 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 31 ms. Remains 513 /515 variables (removed 2) and now considering 1680/1694 (removed 14) transitions.
[2023-04-06 22:13:31] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2023-04-06 22:13:31] [INFO ] Computed 22 invariants in 9 ms
[2023-04-06 22:13:31] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-04-06 22:13:31] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-06 22:13:31] [INFO ] Invariant cache hit.
[2023-04-06 22:13:31] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:33] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-04-06 22:13:33] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-06 22:13:33] [INFO ] Invariant cache hit.
[2023-04-06 22:13:33] [INFO ] Dead Transitions using invariants and state equation in 495 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 2550 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 227 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 379 ms.
Product exploration explored 100000 steps with 0 reset in 300 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 121 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 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) 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-06 22:13:35] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2023-04-06 22:13:35] [INFO ] Invariant cache hit.
[2023-04-06 22:13:35] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:13:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-06 22:13:35] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:13:35] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-06 22:13:35] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:35] [INFO ] After 90ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-06 22:13:35] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-06 22:13:35] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 1 ms to minimize.
[2023-04-06 22:13:36] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 1 ms to minimize.
[2023-04-06 22:13:36] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-04-06 22:13:36] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-04-06 22:13:36] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:13:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1043 ms
[2023-04-06 22:13:36] [INFO ] After 1163ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 22:13:36] [INFO ] After 1476ms 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 79 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 79 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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 734712 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 734712 steps, saw 240985 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:13:39] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-06 22:13:39] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:13:39] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:13:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:13:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:13:40] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:40] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:40] [INFO ] After 50ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:40] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:13:40] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:13:40] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:13:40] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:13:40] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:13:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 471 ms
[2023-04-06 22:13:40] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:13:40] [INFO ] After 745ms 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 32 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 30 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-06 22:13:40] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:40] [INFO ] Invariant cache hit.
[2023-04-06 22:13:41] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-04-06 22:13:41] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:41] [INFO ] Invariant cache hit.
[2023-04-06 22:13:41] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:42] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2023-04-06 22:13:42] [INFO ] Redundant transitions in 68 ms returned []
[2023-04-06 22:13:42] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:42] [INFO ] Invariant cache hit.
[2023-04-06 22:13:42] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1953 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 40 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-06 22:13:42] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:13:42] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:13:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2023-04-06 22:13:42] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:13:42] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:13:42] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:42] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:13:42] [INFO ] After 162ms 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 131 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 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 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 0 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 136 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2023-04-06 22:13:43] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-06 22:13:43] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:13:43] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-04-06 22:13:43] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:13:43] [INFO ] Invariant cache hit.
[2023-04-06 22:13:43] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:44] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
[2023-04-06 22:13:44] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-06 22:13:44] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:13:44] [INFO ] Invariant cache hit.
[2023-04-06 22:13:45] [INFO ] Dead Transitions using invariants and state equation in 414 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 1878 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 81 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 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:13:45] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:13:45] [INFO ] Invariant cache hit.
[2023-04-06 22:13:45] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:13:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:13:45] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:13:45] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-06 22:13:45] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:45] [INFO ] After 43ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-06 22:13:45] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2023-04-06 22:13:45] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 4 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 4 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:13:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 901 ms
[2023-04-06 22:13:46] [INFO ] After 962ms 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-06 22:13:46] [INFO ] After 1163ms 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 0 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 41 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 42 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 744024 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 744024 steps, saw 234137 distinct states, run finished after 3002 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:13:49] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-06 22:13:49] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:13:49] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:13:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:13:49] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:13:49] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:49] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:50] [INFO ] After 45ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 3 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:13:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 546 ms
[2023-04-06 22:13:50] [INFO ] After 609ms 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-06 22:13:50] [INFO ] After 816ms 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 38 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-06 22:13:50] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:50] [INFO ] Invariant cache hit.
[2023-04-06 22:13:50] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-06 22:13:50] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:50] [INFO ] Invariant cache hit.
[2023-04-06 22:13:51] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:51] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-04-06 22:13:51] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-06 22:13:51] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:13:51] [INFO ] Invariant cache hit.
[2023-04-06 22:13:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1681 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 22 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-06 22:13:52] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:13:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:13:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:13:52] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 22:13:52] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:13:52] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:13:52] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-06 22:13:52] [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 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 105 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 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 198 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 30 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-06 22:13:53] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-06 22:13:53] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:13:53] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-04-06 22:13:53] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:13:53] [INFO ] Invariant cache hit.
[2023-04-06 22:13:53] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:13:54] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2023-04-06 22:13:54] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 22:13:54] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:13:54] [INFO ] Invariant cache hit.
[2023-04-06 22:13:55] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1723 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 23886 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 0 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 61 ms. Remains 310 /515 variables (removed 205) and now considering 1465/1694 (removed 229) transitions.
[2023-04-06 22:13:55] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2023-04-06 22:13:55] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:13:55] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-04-06 22:13:55] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-06 22:13:55] [INFO ] Invariant cache hit.
[2023-04-06 22:13:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:13:56] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2023-04-06 22:13:56] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-06 22:13:56] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-06 22:13:56] [INFO ] Invariant cache hit.
[2023-04-06 22:13:56] [INFO ] Dead Transitions using invariants and state equation in 398 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 1746 ms. Remains : 310/515 places, 1465/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-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 27 reset in 207 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-01 finished in 2025 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-06 22:13:57] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:13:57] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:13:57] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-04-06 22:13:57] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:13:57] [INFO ] Invariant cache hit.
[2023-04-06 22:13:57] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:13:59] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2023-04-06 22:13:59] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:13:59] [INFO ] Invariant cache hit.
[2023-04-06 22:13:59] [INFO ] Dead Transitions using invariants and state equation in 503 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 2545 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 117 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 559 ms.
Product exploration explored 100000 steps with 50000 reset in 510 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 19 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 3777 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 19 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:14:00] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:00] [INFO ] Invariant cache hit.
[2023-04-06 22:14:01] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-04-06 22:14:01] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:01] [INFO ] Invariant cache hit.
[2023-04-06 22:14:01] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:02] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-04-06 22:14:02] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:02] [INFO ] Invariant cache hit.
[2023-04-06 22:14:03] [INFO ] Dead Transitions using invariants and state equation in 504 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 2508 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 70 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 489 ms.
Product exploration explored 100000 steps with 50000 reset in 504 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 12 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 3608 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 16 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:14:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:04] [INFO ] Invariant cache hit.
[2023-04-06 22:14:04] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-04-06 22:14:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:04] [INFO ] Invariant cache hit.
[2023-04-06 22:14:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:06] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-04-06 22:14:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:06] [INFO ] Invariant cache hit.
[2023-04-06 22:14:06] [INFO ] Dead Transitions using invariants and state equation in 496 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 2374 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 58 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 478 ms.
Product exploration explored 100000 steps with 50000 reset in 503 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 15 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 3452 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 18 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:14:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:08] [INFO ] Invariant cache hit.
[2023-04-06 22:14:08] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-04-06 22:14:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:08] [INFO ] Invariant cache hit.
[2023-04-06 22:14:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:09] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-04-06 22:14:09] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:09] [INFO ] Invariant cache hit.
[2023-04-06 22:14:10] [INFO ] Dead Transitions using invariants and state equation in 501 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 2461 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 190 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 365 reset in 225 ms.
Stack based approach found an accepted trace after 95 steps with 5 reset with depth 76 and stack size 76 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-10 finished in 2899 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 16 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:14:10] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:10] [INFO ] Invariant cache hit.
[2023-04-06 22:14:11] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-04-06 22:14:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:11] [INFO ] Invariant cache hit.
[2023-04-06 22:14:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:12] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
[2023-04-06 22:14:12] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:14:12] [INFO ] Invariant cache hit.
[2023-04-06 22:14:13] [INFO ] Dead Transitions using invariants and state equation in 488 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 2487 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 66 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 234 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-12 finished in 2577 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 13 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-06 22:14:13] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-06 22:14:13] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:14:13] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-04-06 22:14:13] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:14:13] [INFO ] Invariant cache hit.
[2023-04-06 22:14:14] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:14:15] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
[2023-04-06 22:14:15] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:14:15] [INFO ] Invariant cache hit.
[2023-04-06 22:14:16] [INFO ] Dead Transitions using invariants and state equation in 491 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 2791 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 72 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 186 ms.
Stack based approach found an accepted trace after 18415 steps with 24 reset with depth 56 and stack size 54 in 38 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-13 finished in 3109 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 60 ms. Remains 309 /515 variables (removed 206) and now considering 1470/1694 (removed 224) transitions.
[2023-04-06 22:14:16] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
// Phase 1: matrix 511 rows 309 cols
[2023-04-06 22:14:16] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:14:16] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-04-06 22:14:16] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2023-04-06 22:14:16] [INFO ] Invariant cache hit.
[2023-04-06 22:14:17] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:14:17] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2023-04-06 22:14:17] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-06 22:14:17] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2023-04-06 22:14:17] [INFO ] Invariant cache hit.
[2023-04-06 22:14:18] [INFO ] Dead Transitions using invariants and state equation in 406 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 1765 ms. Remains : 309/515 places, 1470/1694 transitions.
Stuttering acceptance computed with spot in 33 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 171 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 1984 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 61 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-06 22:14:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:14:18] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:14:18] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-04-06 22:14:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:14:18] [INFO ] Invariant cache hit.
[2023-04-06 22:14:19] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:19] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2023-04-06 22:14:19] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-06 22:14:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:14:19] [INFO ] Invariant cache hit.
[2023-04-06 22:14:20] [INFO ] Dead Transitions using invariants and state equation in 400 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 1739 ms. Remains : 308/515 places, 1463/1694 transitions.
Stuttering acceptance computed with spot in 37 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 191 reset in 167 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-15 finished in 1965 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 154 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 0 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 44 ms. Remains 314 /515 variables (removed 201) and now considering 1481/1694 (removed 213) transitions.
[2023-04-06 22:14:20] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-06 22:14:20] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:14:21] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-06 22:14:21] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:21] [INFO ] Invariant cache hit.
[2023-04-06 22:14:21] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:22] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2023-04-06 22:14:22] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:22] [INFO ] Invariant cache hit.
[2023-04-06 22:14:22] [INFO ] Dead Transitions using invariants and state equation in 418 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 1744 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 165 ms.
Product exploration explored 100000 steps with 0 reset in 199 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 114 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 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:14:23] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:23] [INFO ] Invariant cache hit.
[2023-04-06 22:14:23] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:14:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:14:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 22:14:23] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-06 22:14:23] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:23] [INFO ] After 56ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-06 22:14:23] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 4 ms to minimize.
[2023-04-06 22:14:23] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2023-04-06 22:14:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 22:14:24] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:14:24] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:14:24] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-06 22:14:24] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:14:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 685 ms
[2023-04-06 22:14:24] [INFO ] After 755ms 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-06 22:14:24] [INFO ] After 972ms 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 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 39 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 40 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 743472 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 743472 steps, saw 233859 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:14:27] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-06 22:14:27] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:14:27] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:14:27] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:27] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:27] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:27] [INFO ] After 50ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:14:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 649 ms
[2023-04-06 22:14:28] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:14:28] [INFO ] After 933ms 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 28 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-06 22:14:28] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:28] [INFO ] Invariant cache hit.
[2023-04-06 22:14:28] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-04-06 22:14:28] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:28] [INFO ] Invariant cache hit.
[2023-04-06 22:14:28] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:29] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-04-06 22:14:29] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-06 22:14:29] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:29] [INFO ] Invariant cache hit.
[2023-04-06 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1646 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 15 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-06 22:14:30] [INFO ] Computed 16 invariants in 0 ms
[2023-04-06 22:14:30] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:14:30] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 22:14:30] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:14:30] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:30] [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 5 ms.
[2023-04-06 22:14:30] [INFO ] After 73ms 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 104 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 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 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 35 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-06 22:14:30] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-06 22:14:30] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:14:30] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-04-06 22:14:30] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:30] [INFO ] Invariant cache hit.
[2023-04-06 22:14:30] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:31] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2023-04-06 22:14:31] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-06 22:14:31] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:31] [INFO ] Invariant cache hit.
[2023-04-06 22:14:32] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1826 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 91 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 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:14:32] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:32] [INFO ] Invariant cache hit.
[2023-04-06 22:14:32] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:14:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:14:32] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:32] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-06 22:14:32] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:33] [INFO ] After 46ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 667 ms
[2023-04-06 22:14:33] [INFO ] After 737ms 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-06 22:14:33] [INFO ] After 941ms 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 38 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 38 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 738392 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738392 steps, saw 231779 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:14:36] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2023-04-06 22:14:36] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:14:36] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:14:36] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:37] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:37] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:37] [INFO ] After 53ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 640 ms
[2023-04-06 22:14:37] [INFO ] After 722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:14:37] [INFO ] After 919ms 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 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 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 27 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2023-04-06 22:14:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:37] [INFO ] Invariant cache hit.
[2023-04-06 22:14:38] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-04-06 22:14:38] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:38] [INFO ] Invariant cache hit.
[2023-04-06 22:14:38] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:39] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-04-06 22:14:39] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-06 22:14:39] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2023-04-06 22:14:39] [INFO ] Invariant cache hit.
[2023-04-06 22:14:39] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1784 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 1 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 22 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-06 22:14:39] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:14:39] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:14:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:14:39] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:14:39] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:39] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:14:39] [INFO ] After 88ms 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 122 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 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 194 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 28 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2023-04-06 22:14:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2023-04-06 22:14:40] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:14:40] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-06 22:14:40] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:40] [INFO ] Invariant cache hit.
[2023-04-06 22:14:41] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-04-06 22:14:41] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-04-06 22:14:41] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 22:14:41] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2023-04-06 22:14:41] [INFO ] Invariant cache hit.
[2023-04-06 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1766 ms. Remains : 314/314 places, 1481/1481 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 21871 ms.
[2023-04-06 22:14:42] [INFO ] Flatten gal took : 54 ms
[2023-04-06 22:14:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-06 22:14:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 1694 transitions and 8148 arcs took 17 ms.
Total runtime 86994 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-07
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1680819338617

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-07-LTLCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 EisenbergMcGuire-PT-07-LTLCardinality-00 515241 m, 103048 m/sec, 1229400 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 8/32 EisenbergMcGuire-PT-07-LTLCardinality-00 966667 m, 90285 m/sec, 2483692 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 11/32 EisenbergMcGuire-PT-07-LTLCardinality-00 1369298 m, 80526 m/sec, 3760721 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 14/32 EisenbergMcGuire-PT-07-LTLCardinality-00 1777396 m, 81619 m/sec, 5020591 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 17/32 EisenbergMcGuire-PT-07-LTLCardinality-00 2168036 m, 78128 m/sec, 6271474 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 19/32 EisenbergMcGuire-PT-07-LTLCardinality-00 2546737 m, 75740 m/sec, 7521426 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 22/32 EisenbergMcGuire-PT-07-LTLCardinality-00 2922297 m, 75112 m/sec, 8763384 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 25/32 EisenbergMcGuire-PT-07-LTLCardinality-00 3294208 m, 74382 m/sec, 10012706 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 28/32 EisenbergMcGuire-PT-07-LTLCardinality-00 3660407 m, 73239 m/sec, 11261108 t fired, .

Time elapsed: 45 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 30/32 EisenbergMcGuire-PT-07-LTLCardinality-00 4026426 m, 73203 m/sec, 12500714 t fired, .

Time elapsed: 50 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for EisenbergMcGuire-PT-07-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLCardinality-00: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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