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-167987245000260.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 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 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 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.7M 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-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680822405844

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 23:06:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 23:06:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:06:47] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-04-06 23:06:47] [INFO ] Transformed 712 places.
[2023-04-06 23:06:47] [INFO ] Transformed 2816 transitions.
[2023-04-06 23:06:47] [INFO ] Found NUPN structural information;
[2023-04-06 23:06:47] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 660 transition count 2400
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 660 transition count 2400
Applied a total of 104 rules in 120 ms. Remains 660 /712 variables (removed 52) and now considering 2400/2816 (removed 416) transitions.
[2023-04-06 23:06:47] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
// Phase 1: matrix 952 rows 660 cols
[2023-04-06 23:06:47] [INFO ] Computed 25 invariants in 25 ms
[2023-04-06 23:06:48] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-04-06 23:06:48] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-06 23:06:48] [INFO ] Invariant cache hit.
[2023-04-06 23:06:48] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-06 23:06:50] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
[2023-04-06 23:06:50] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-06 23:06:50] [INFO ] Invariant cache hit.
[2023-04-06 23:06:51] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/712 places, 2400/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3380 ms. Remains : 660/712 places, 2400/2816 transitions.
Support contains 47 out of 660 places after structural reductions.
[2023-04-06 23:06:51] [INFO ] Flatten gal took : 157 ms
[2023-04-06 23:06:51] [INFO ] Flatten gal took : 114 ms
[2023-04-06 23:06:51] [INFO ] Input system was already deterministic with 2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-04-06 23:06:52] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-06 23:06:52] [INFO ] Invariant cache hit.
[2023-04-06 23:06:52] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-04-06 23:06:52] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 23:06:53] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-06 23:06:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-04-06 23:06:53] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-06 23:06:55] [INFO ] After 1151ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-04-06 23:06:55] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-06 23:06:56] [INFO ] After 1310ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :1 sat :22
[2023-04-06 23:06:56] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 4 ms to minimize.
[2023-04-06 23:06:56] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-04-06 23:06:56] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:06:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1473 ms
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 0 ms to minimize.
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-04-06 23:06:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 23:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:06:58] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-04-06 23:06:59] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2023-04-06 23:06:59] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-04-06 23:06:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2023-04-06 23:07:00] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 23:07:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 23:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 23:07:00] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-06 23:07:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:07:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-06 23:07:01] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:07:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 23:07:01] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:07:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-06 23:07:01] [INFO ] After 6871ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 1361 ms.
[2023-04-06 23:07:03] [INFO ] After 9992ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1282 ms.
Support contains 38 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 451 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 451 transition count 2177
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 528 place count 396 transition count 2122
Applied a total of 528 rules in 227 ms. Remains 396 /660 variables (removed 264) and now considering 2122/2400 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 396/660 places, 2122/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 153567 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{6=1, 12=1, 21=1}
Probabilistic random walk after 153567 steps, saw 96123 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :3
Running SMT prover for 19 properties.
[2023-04-06 23:07:08] [INFO ] Flow matrix only has 674 transitions (discarded 1448 similar events)
// Phase 1: matrix 674 rows 396 cols
[2023-04-06 23:07:08] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 23:07:08] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 23:07:08] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:07:08] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:07:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 23:07:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 23:07:09] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:09] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-06 23:07:10] [INFO ] After 711ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:10] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-06 23:07:10] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-04-06 23:07:10] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-06 23:07:10] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-06 23:07:10] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:07:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 761 ms
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 23:07:11] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 23:07:12] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 23:07:12] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 23:07:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 23:07:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:07:13] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:07:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-04-06 23:07:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:07:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:07:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-04-06 23:07:13] [INFO ] After 4026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 775 ms.
[2023-04-06 23:07:14] [INFO ] After 5709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 153 ms.
Support contains 35 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2122/2122 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 396 transition count 2121
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 395 transition count 2121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 394 transition count 2113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 394 transition count 2113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 393 transition count 2112
Applied a total of 6 rules in 220 ms. Remains 393 /396 variables (removed 3) and now considering 2112/2122 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 393/396 places, 2112/2122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 165717 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165717 steps, saw 101380 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-06 23:07:18] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2023-04-06 23:07:18] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 23:07:18] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 23:07:18] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:07:18] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:07:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 23:07:18] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:07:19] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:19] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:07:20] [INFO ] After 739ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:07:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 612 ms
[2023-04-06 23:07:20] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 4 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:07:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 956 ms
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2023-04-06 23:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-06 23:07:22] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2023-04-06 23:07:23] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-04-06 23:07:23] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-04-06 23:07:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2023-04-06 23:07:23] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-04-06 23:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 23:07:23] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2023-04-06 23:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-06 23:07:23] [INFO ] After 4493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 797 ms.
[2023-04-06 23:07:24] [INFO ] After 6176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 141 ms.
Support contains 35 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 58 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 65 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:25] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-04-06 23:07:25] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-06 23:07:25] [INFO ] Invariant cache hit.
[2023-04-06 23:07:25] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:07:26] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2023-04-06 23:07:26] [INFO ] Redundant transitions in 120 ms returned []
[2023-04-06 23:07:26] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-06 23:07:26] [INFO ] Invariant cache hit.
[2023-04-06 23:07:27] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2448 ms. Remains : 393/393 places, 2112/2112 transitions.
Graph (trivial) has 1628 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 337 transition count 427
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 273 transition count 427
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 129 place count 273 transition count 411
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 168 place count 250 transition count 411
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 366 place count 151 transition count 312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 399 place count 151 transition count 279
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 415 place count 151 transition count 263
Free-agglomeration rule applied 72 times.
Iterating global reduction 3 with 72 rules applied. Total rules applied 487 place count 151 transition count 191
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 559 place count 79 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 568 place count 79 transition count 191
Applied a total of 568 rules in 38 ms. Remains 79 /393 variables (removed 314) and now considering 191/2112 (removed 1921) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 191 rows 79 cols
[2023-04-06 23:07:27] [INFO ] Computed 18 invariants in 2 ms
[2023-04-06 23:07:27] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 23:07:27] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:07:27] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:07:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 23:07:27] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:07:27] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-06 23:07:27] [INFO ] After 129ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:07:27] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2023-04-06 23:07:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-06 23:07:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-06 23:07:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 23:07:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-06 23:07:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 165 ms
[2023-04-06 23:07:28] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-04-06 23:07:28] [INFO ] After 850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(G(p0)) U p1))'
Support contains 5 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 182 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-06 23:07:28] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 23:07:28] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 23:07:29] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-04-06 23:07:29] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:07:29] [INFO ] Invariant cache hit.
[2023-04-06 23:07:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:30] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
[2023-04-06 23:07:30] [INFO ] Redundant transitions in 106 ms returned []
[2023-04-06 23:07:30] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:07:30] [INFO ] Invariant cache hit.
[2023-04-06 23:07:31] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2874 ms. Remains : 393/660 places, 2105/2400 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 224 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s285 1)), p0:(AND (EQ s28 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 356 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 3538 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 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 172 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-06 23:07:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:07:32] [INFO ] Computed 25 invariants in 9 ms
[2023-04-06 23:07:32] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-04-06 23:07:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:07:32] [INFO ] Invariant cache hit.
[2023-04-06 23:07:32] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:34] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2023-04-06 23:07:34] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-06 23:07:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:07:34] [INFO ] Invariant cache hit.
[2023-04-06 23:07:34] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2812 ms. Remains : 392/660 places, 2104/2400 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-01 finished in 3101 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 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 40 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:07:35] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:07:35] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 23:07:35] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-04-06 23:07:35] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:35] [INFO ] Invariant cache hit.
[2023-04-06 23:07:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:38] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned []
Implicit Place search using SMT with State Equation took 3158 ms to find 0 implicit places.
[2023-04-06 23:07:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:38] [INFO ] Invariant cache hit.
[2023-04-06 23:07:39] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3954 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02 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 s24 0) (EQ s137 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 817 ms.
Product exploration explored 100000 steps with 50000 reset in 756 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 22 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-08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 5663 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((G(F(p0))||(F(p0)&&X(G(p1)))))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 32 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:07:40] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:40] [INFO ] Invariant cache hit.
[2023-04-06 23:07:41] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-04-06 23:07:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:41] [INFO ] Invariant cache hit.
[2023-04-06 23:07:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:43] [INFO ] Implicit Places using invariants and state equation in 2468 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2023-04-06 23:07:43] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:43] [INFO ] Invariant cache hit.
[2023-04-06 23:07:44] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3636 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s4 1) (EQ s20 1) (EQ s449 1)) (AND (EQ s7 1) (EQ s30 1) (EQ s482 1))), p1:(NEQ s293 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 1235 steps with 0 reset with depth 1236 and stack size 1219 in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 4034 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(G(p0))&&(F(p1) U p2))))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 24 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:07:44] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:44] [INFO ] Invariant cache hit.
[2023-04-06 23:07:45] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-04-06 23:07:45] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:45] [INFO ] Invariant cache hit.
[2023-04-06 23:07:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:47] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
[2023-04-06 23:07:47] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:47] [INFO ] Invariant cache hit.
[2023-04-06 23:07:48] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3725 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s17 1) (EQ s433 1)), p1:(AND (EQ s4 1) (EQ s22 1) (EQ s436 1)), p0:(AND (EQ s2 1) (EQ s16 1) (EQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-05 finished in 4204 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(G(p0))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 21 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:07:49] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:49] [INFO ] Invariant cache hit.
[2023-04-06 23:07:49] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-04-06 23:07:49] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:49] [INFO ] Invariant cache hit.
[2023-04-06 23:07:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:52] [INFO ] Implicit Places using invariants and state equation in 2732 ms returned []
Implicit Place search using SMT with State Equation took 3132 ms to find 0 implicit places.
[2023-04-06 23:07:52] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:52] [INFO ] Invariant cache hit.
[2023-04-06 23:07:52] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3931 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s333 1))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 206 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6226 steps, run visited all 1 properties in 39 ms. (steps per millisecond=159 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 39 ms. (steps per millisecond=159 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 13 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-06 23:07:54] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:54] [INFO ] Invariant cache hit.
[2023-04-06 23:07:54] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-04-06 23:07:54] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:54] [INFO ] Invariant cache hit.
[2023-04-06 23:07:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:07:57] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 3146 ms to find 0 implicit places.
[2023-04-06 23:07:57] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:07:57] [INFO ] Invariant cache hit.
[2023-04-06 23:07:58] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3904 ms. Remains : 656/656 places, 2368/2368 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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
Finished probabilistic random walk after 6226 steps, run visited all 1 properties in 40 ms. (steps per millisecond=155 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 41 ms. (steps per millisecond=151 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Product exploration explored 100000 steps with 0 reset in 294 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2368
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 191 Pre rules applied. Total rules applied 8 place count 656 transition count 2686
Deduced a syphon composed of 199 places in 1 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 199 place count 656 transition count 2686
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 263 place count 656 transition count 2686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 271 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 279 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 279 rules in 184 ms. Remains 648 /656 variables (removed 8) and now considering 2678/2368 (removed -310) transitions.
[2023-04-06 23:08:00] [INFO ] Redundant transitions in 57 ms returned []
[2023-04-06 23:08:00] [INFO ] Flow matrix only has 1071 transitions (discarded 1607 similar events)
// Phase 1: matrix 1071 rows 648 cols
[2023-04-06 23:08:00] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 23:08:00] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 648/656 places, 2678/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1036 ms. Remains : 648/656 places, 2678/2368 transitions.
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 17 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-06 23:08:00] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:08:00] [INFO ] Computed 25 invariants in 9 ms
[2023-04-06 23:08:01] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-04-06 23:08:01] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:01] [INFO ] Invariant cache hit.
[2023-04-06 23:08:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:03] [INFO ] Implicit Places using invariants and state equation in 2718 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
[2023-04-06 23:08:03] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:03] [INFO ] Invariant cache hit.
[2023-04-06 23:08:04] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3812 ms. Remains : 656/656 places, 2368/2368 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 15744 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((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 37 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:08:04] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:04] [INFO ] Invariant cache hit.
[2023-04-06 23:08:05] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-04-06 23:08:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:05] [INFO ] Invariant cache hit.
[2023-04-06 23:08:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:08] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 3516 ms to find 0 implicit places.
[2023-04-06 23:08:08] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:08] [INFO ] Invariant cache hit.
[2023-04-06 23:08:09] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4294 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 187 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s456 1)), p0:(OR (NEQ s0 1) (NEQ s9 1) (NEQ s448 1)), p2:(AND (EQ s0 1) (EQ s9 1) (EQ s448 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 757 ms.
Product exploration explored 100000 steps with 50000 reset in 782 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 (NOT p2)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-08 finished in 6078 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(G(p0))||G(F(!p1))||(F(!p1)&&F(p2)))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 657 transition count 2376
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 657 transition count 2376
Applied a total of 6 rules in 28 ms. Remains 657 /660 variables (removed 3) and now considering 2376/2400 (removed 24) transitions.
[2023-04-06 23:08:10] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
// Phase 1: matrix 928 rows 657 cols
[2023-04-06 23:08:10] [INFO ] Computed 25 invariants in 9 ms
[2023-04-06 23:08:11] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-04-06 23:08:11] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-06 23:08:11] [INFO ] Invariant cache hit.
[2023-04-06 23:08:11] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:08:13] [INFO ] Implicit Places using invariants and state equation in 2698 ms returned []
Implicit Place search using SMT with State Equation took 3082 ms to find 0 implicit places.
[2023-04-06 23:08:13] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-06 23:08:13] [INFO ] Invariant cache hit.
[2023-04-06 23:08:14] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 657/660 places, 2376/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3875 ms. Remains : 657/660 places, 2376/2400 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p1:(AND (EQ s0 1) (EQ s9 1) (EQ s466 1)), p2:(NEQ s172 1), p0:(AND (EQ s4 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 776 ms.
Product exploration explored 100000 steps with 50000 reset in 786 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) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 5710 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(!X((!X(G((X(p1)&&!p2)))&&p0))) U p3))'
Support contains 10 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 115 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-06 23:08:16] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-06 23:08:16] [INFO ] Computed 25 invariants in 2 ms
[2023-04-06 23:08:17] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-04-06 23:08:17] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-06 23:08:17] [INFO ] Invariant cache hit.
[2023-04-06 23:08:17] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:08:18] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2023-04-06 23:08:18] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-06 23:08:18] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-06 23:08:18] [INFO ] Invariant cache hit.
[2023-04-06 23:08:19] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2724 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p3), (OR (NOT p3) (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0), acceptance={} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s0 1) (EQ s46 1)), p0:(AND (EQ s1 1) (EQ s12 1) (EQ s291 1)), p2:(AND (EQ s24 1) (EQ s112 1)), p1:(AND (EQ s6 1) (EQ s28 1) (EQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10964 reset in 372 ms.
Stack based approach found an accepted trace after 155 steps with 14 reset with depth 22 and stack size 22 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 3295 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(((!p0&&G(!p1)) U !p2)))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 26 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:08:19] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:08:19] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 23:08:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-04-06 23:08:20] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:20] [INFO ] Invariant cache hit.
[2023-04-06 23:08:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:22] [INFO ] Implicit Places using invariants and state equation in 2667 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
[2023-04-06 23:08:22] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:22] [INFO ] Invariant cache hit.
[2023-04-06 23:08:23] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3779 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 150 ms :[p2, p2, true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s9 1) (EQ s493 1)), p0:(AND (EQ s4 1) (EQ s20 1) (EQ s478 1)), p1:(AND (EQ s7 1) (EQ s29 1) (EQ s480 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 50000 reset in 801 ms.
Product exploration explored 100000 steps with 50000 reset in 797 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 p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 5669 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 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 28 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:08:25] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:25] [INFO ] Invariant cache hit.
[2023-04-06 23:08:25] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-04-06 23:08:25] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:25] [INFO ] Invariant cache hit.
[2023-04-06 23:08:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:28] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3035 ms to find 0 implicit places.
[2023-04-06 23:08:28] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:28] [INFO ] Invariant cache hit.
[2023-04-06 23:08:29] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3794 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-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:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s460 1))], 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]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Product exploration explored 100000 steps with 0 reset in 310 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 520794 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520794 steps, saw 360540 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:08:33] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:08:33] [INFO ] Invariant cache hit.
[2023-04-06 23:08:33] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-06 23:08:33] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 23:08:33] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-06 23:08:33] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 23:08:33] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:34] [INFO ] After 117ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:34] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-04-06 23:08:34] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-06 23:08:34] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-06 23:08:34] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 0 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 0 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-04-06 23:08:35] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:08:36] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:08:36] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:08:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2125 ms
[2023-04-06 23:08:36] [INFO ] After 2292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-06 23:08:36] [INFO ] After 2731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 91 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 392/656 places, 2104/2368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 562644 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 562644 steps, saw 290241 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:08:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:08:39] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 23:08:39] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:08:39] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:08:39] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:08:39] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:08:39] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:39] [INFO ] After 67ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 23:08:40] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:08:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1565 ms
[2023-04-06 23:08:41] [INFO ] After 1671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:08:41] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 76 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:08:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:41] [INFO ] Invariant cache hit.
[2023-04-06 23:08:42] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-06 23:08:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:42] [INFO ] Invariant cache hit.
[2023-04-06 23:08:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:43] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-04-06 23:08:43] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 23:08:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:43] [INFO ] Invariant cache hit.
[2023-04-06 23:08:44] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2616 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 25 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 23:08:44] [INFO ] Computed 17 invariants in 2 ms
[2023-04-06 23:08:44] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 23:08:44] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 23:08:44] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 23:08:44] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:44] [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 23:08:44] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 99 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2023-04-06 23:08:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:08:44] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 23:08:45] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-04-06 23:08:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:45] [INFO ] Invariant cache hit.
[2023-04-06 23:08:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:46] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2023-04-06 23:08:46] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-06 23:08:46] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:46] [INFO ] Invariant cache hit.
[2023-04-06 23:08:47] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2623 ms. Remains : 392/656 places, 2104/2368 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 531801 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 531801 steps, saw 275839 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:08:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:50] [INFO ] Invariant cache hit.
[2023-04-06 23:08:50] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-06 23:08:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:08:50] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 23:08:50] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 23:08:50] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:51] [INFO ] After 70ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1457 ms
[2023-04-06 23:08:52] [INFO ] After 1559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 23:08:52] [INFO ] After 1830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 544104 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544104 steps, saw 281365 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:08:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:55] [INFO ] Invariant cache hit.
[2023-04-06 23:08:55] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 23:08:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:08:55] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:08:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:08:56] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:56] [INFO ] After 72ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:56] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-04-06 23:08:56] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-06 23:08:56] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-06 23:08:56] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1460 ms
[2023-04-06 23:08:57] [INFO ] After 1562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 23:08:57] [INFO ] After 1844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:08:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:57] [INFO ] Invariant cache hit.
[2023-04-06 23:08:58] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-04-06 23:08:58] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:58] [INFO ] Invariant cache hit.
[2023-04-06 23:08:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:08:59] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2023-04-06 23:08:59] [INFO ] Redundant transitions in 41 ms returned []
[2023-04-06 23:08:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:08:59] [INFO ] Invariant cache hit.
[2023-04-06 23:09:00] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2586 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 18 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 23:09:00] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 23:09:00] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 23:09:00] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 23:09:00] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 23:09:00] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:00] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 23:09:00] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:09:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:09:01] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 23:09:01] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-06 23:09:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:01] [INFO ] Invariant cache hit.
[2023-04-06 23:09:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:03] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2023-04-06 23:09:03] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-06 23:09:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:03] [INFO ] Invariant cache hit.
[2023-04-06 23:09:03] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2557 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 38360 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 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 23 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-06 23:09:03] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:09:03] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 23:09:04] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-04-06 23:09:04] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:09:04] [INFO ] Invariant cache hit.
[2023-04-06 23:09:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:06] [INFO ] Implicit Places using invariants and state equation in 2480 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2023-04-06 23:09:06] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:09:06] [INFO ] Invariant cache hit.
[2023-04-06 23:09:07] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3589 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s31 1) (EQ s478 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 0 reset in 229 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 3907 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(((p1||X(F(p2)))&&p0))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 102 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-06 23:09:07] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-06 23:09:07] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 23:09:08] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-04-06 23:09:08] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-06 23:09:08] [INFO ] Invariant cache hit.
[2023-04-06 23:09:08] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:09:09] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-04-06 23:09:09] [INFO ] Redundant transitions in 42 ms returned []
[2023-04-06 23:09:09] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-06 23:09:09] [INFO ] Invariant cache hit.
[2023-04-06 23:09:10] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2615 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s29 1) (EQ s256 1)), p1:(EQ s192 1), p2:(AND (EQ s6 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-15 finished in 2935 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(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-07
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 62 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-06 23:09:11] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 23:09:11] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 23:09:11] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-04-06 23:09:11] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:11] [INFO ] Invariant cache hit.
[2023-04-06 23:09:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:13] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2023-04-06 23:09:13] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:13] [INFO ] Invariant cache hit.
[2023-04-06 23:09:13] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2683 ms. Remains : 393/660 places, 2105/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s176 1))], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 305 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 6085 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1217 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 7 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 23:09:14] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:14] [INFO ] Invariant cache hit.
[2023-04-06 23:09:15] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-06 23:09:15] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:15] [INFO ] Invariant cache hit.
[2023-04-06 23:09:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:16] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-04-06 23:09:16] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:16] [INFO ] Invariant cache hit.
[2023-04-06 23:09:17] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2544 ms. Remains : 393/393 places, 2105/2105 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 3051 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1017 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 60 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 23:09:18] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-06 23:09:18] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:18] [INFO ] Invariant cache hit.
[2023-04-06 23:09:19] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 882 ms. Remains : 393/393 places, 2105/2105 transitions.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 6 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:19] [INFO ] Invariant cache hit.
[2023-04-06 23:09:19] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:19] [INFO ] Invariant cache hit.
[2023-04-06 23:09:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:21] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2023-04-06 23:09:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 23:09:21] [INFO ] Invariant cache hit.
[2023-04-06 23:09:22] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2602 ms. Remains : 393/393 places, 2105/2105 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 11567 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)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 68 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-06 23:09:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:09:22] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 23:09:22] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-04-06 23:09:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:22] [INFO ] Invariant cache hit.
[2023-04-06 23:09:23] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:24] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-04-06 23:09:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:24] [INFO ] Invariant cache hit.
[2023-04-06 23:09:25] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2550 ms. Remains : 392/660 places, 2104/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-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:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s265 1))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 268 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 561429 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561429 steps, saw 289710 distinct states, run finished after 3003 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:09:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:28] [INFO ] Invariant cache hit.
[2023-04-06 23:09:28] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-06 23:09:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:29] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:29] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:29] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:29] [INFO ] After 67ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:29] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-04-06 23:09:29] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2023-04-06 23:09:29] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-06 23:09:29] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:09:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1492 ms
[2023-04-06 23:09:30] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 23:09:30] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 565344 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565344 steps, saw 291622 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:09:33] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:33] [INFO ] Invariant cache hit.
[2023-04-06 23:09:34] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:34] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:34] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:34] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:34] [INFO ] After 74ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:34] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-06 23:09:34] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-04-06 23:09:35] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:09:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1461 ms
[2023-04-06 23:09:36] [INFO ] After 1573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:09:36] [INFO ] After 1866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:09:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:36] [INFO ] Invariant cache hit.
[2023-04-06 23:09:36] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-04-06 23:09:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:36] [INFO ] Invariant cache hit.
[2023-04-06 23:09:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:38] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-04-06 23:09:38] [INFO ] Redundant transitions in 42 ms returned []
[2023-04-06 23:09:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:38] [INFO ] Invariant cache hit.
[2023-04-06 23:09:38] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2596 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 22 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 23:09:38] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 23:09:38] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 23:09:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 23:09:38] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 23:09:38] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:38] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 23:09:38] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:09:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:09:39] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 23:09:39] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-06 23:09:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:39] [INFO ] Invariant cache hit.
[2023-04-06 23:09:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:40] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-04-06 23:09:41] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-06 23:09:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:41] [INFO ] Invariant cache hit.
[2023-04-06 23:09:41] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2573 ms. Remains : 392/392 places, 2104/2104 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 549405 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549405 steps, saw 283813 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:09:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:44] [INFO ] Invariant cache hit.
[2023-04-06 23:09:44] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 23:09:45] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:45] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:45] [INFO ] After 71ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:45] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-06 23:09:45] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-06 23:09:45] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:09:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1422 ms
[2023-04-06 23:09:46] [INFO ] After 1523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-06 23:09:46] [INFO ] After 1817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 555633 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555633 steps, saw 286541 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:09:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:49] [INFO ] Invariant cache hit.
[2023-04-06 23:09:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:50] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 23:09:50] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 23:09:50] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:50] [INFO ] After 71ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:50] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-06 23:09:50] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2023-04-06 23:09:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:09:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:09:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1557 ms
[2023-04-06 23:09:52] [INFO ] After 1667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:09:52] [INFO ] After 1954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:09:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:52] [INFO ] Invariant cache hit.
[2023-04-06 23:09:52] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-04-06 23:09:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:52] [INFO ] Invariant cache hit.
[2023-04-06 23:09:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:54] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-04-06 23:09:54] [INFO ] Redundant transitions in 41 ms returned []
[2023-04-06 23:09:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:54] [INFO ] Invariant cache hit.
[2023-04-06 23:09:54] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2595 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 14 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 23:09:54] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 23:09:54] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 23:09:54] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:09:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 23:09:54] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 23:09:54] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:09:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 23:09:54] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 262 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 50 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 23:09:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 23:09:55] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 23:09:56] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-04-06 23:09:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:56] [INFO ] Invariant cache hit.
[2023-04-06 23:09:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:09:57] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-04-06 23:09:57] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-06 23:09:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 23:09:57] [INFO ] Invariant cache hit.
[2023-04-06 23:09:58] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2598 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 36011 ms.
[2023-04-06 23:09:58] [INFO ] Flatten gal took : 88 ms
[2023-04-06 23:09:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-06 23:09:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 660 places, 2400 transitions and 11776 arcs took 19 ms.
Total runtime 191158 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-08
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680822659634

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-08-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for EisenbergMcGuire-PT-08-LTLFireability-07
lola: result : false
lola: markings : 490
lola: fired transitions : 647
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 EisenbergMcGuire-PT-08-LTLFireability-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3600 4/32 EisenbergMcGuire-PT-08-LTLFireability-12 463525 m, 92705 m/sec, 917168 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3600 8/32 EisenbergMcGuire-PT-08-LTLFireability-12 908298 m, 88954 m/sec, 1868004 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3600 11/32 EisenbergMcGuire-PT-08-LTLFireability-12 1287035 m, 75747 m/sec, 2860362 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3600 14/32 EisenbergMcGuire-PT-08-LTLFireability-12 1649216 m, 72436 m/sec, 3824870 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3600 17/32 EisenbergMcGuire-PT-08-LTLFireability-12 2001565 m, 70469 m/sec, 4778919 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3600 19/32 EisenbergMcGuire-PT-08-LTLFireability-12 2320487 m, 63784 m/sec, 5766463 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3600 22/32 EisenbergMcGuire-PT-08-LTLFireability-12 2635020 m, 62906 m/sec, 6762661 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3600 25/32 EisenbergMcGuire-PT-08-LTLFireability-12 2990508 m, 71097 m/sec, 7694352 t fired, .

Time elapsed: 40 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3600 27/32 EisenbergMcGuire-PT-08-LTLFireability-12 3330397 m, 67977 m/sec, 8641203 t fired, .

Time elapsed: 45 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3600 30/32 EisenbergMcGuire-PT-08-LTLFireability-12 3625384 m, 58997 m/sec, 9635437 t fired, .

Time elapsed: 50 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3600 32/32 EisenbergMcGuire-PT-08-LTLFireability-12 3966791 m, 68281 m/sec, 10574732 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for EisenbergMcGuire-PT-08-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-08-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLFireability-07: LTL false LTL model checker
EisenbergMcGuire-PT-08-LTLFireability-12: LTL unknown AGGR


Time elapsed: 60 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-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is EisenbergMcGuire-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987245000260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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