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.r487-tall-167912703100460.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 Szymanski-PT-b04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703100460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Feb 26 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 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 Szymanski-PT-b04-LTLFireability-00
FORMULA_NAME Szymanski-PT-b04-LTLFireability-01
FORMULA_NAME Szymanski-PT-b04-LTLFireability-02
FORMULA_NAME Szymanski-PT-b04-LTLFireability-03
FORMULA_NAME Szymanski-PT-b04-LTLFireability-04
FORMULA_NAME Szymanski-PT-b04-LTLFireability-05
FORMULA_NAME Szymanski-PT-b04-LTLFireability-06
FORMULA_NAME Szymanski-PT-b04-LTLFireability-07
FORMULA_NAME Szymanski-PT-b04-LTLFireability-08
FORMULA_NAME Szymanski-PT-b04-LTLFireability-09
FORMULA_NAME Szymanski-PT-b04-LTLFireability-10
FORMULA_NAME Szymanski-PT-b04-LTLFireability-11
FORMULA_NAME Szymanski-PT-b04-LTLFireability-12
FORMULA_NAME Szymanski-PT-b04-LTLFireability-13
FORMULA_NAME Szymanski-PT-b04-LTLFireability-14
FORMULA_NAME Szymanski-PT-b04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679190435838

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=Szymanski-PT-b04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 01:47:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 01:47:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:47:17] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2023-03-19 01:47:17] [INFO ] Transformed 568 places.
[2023-03-19 01:47:17] [INFO ] Transformed 8320 transitions.
[2023-03-19 01:47:17] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 163 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 01:47:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:47:18] [INFO ] Computed 1 place invariants in 55 ms
[2023-03-19 01:47:18] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-19 01:47:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:47:18] [INFO ] Invariant cache hit.
[2023-03-19 01:47:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:47:25] [INFO ] Implicit Places using invariants and state equation in 6562 ms returned []
Implicit Place search using SMT with State Equation took 7127 ms to find 0 implicit places.
[2023-03-19 01:47:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:47:25] [INFO ] Invariant cache hit.
[2023-03-19 01:47:27] [INFO ] Dead Transitions using invariants and state equation in 1819 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9112 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 41 out of 305 places after structural reductions.
[2023-03-19 01:47:27] [INFO ] Flatten gal took : 384 ms
[2023-03-19 01:47:27] [INFO ] Flatten gal took : 253 ms
[2023-03-19 01:47:28] [INFO ] Input system was already deterministic with 7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 01:47:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:47:28] [INFO ] Invariant cache hit.
[2023-03-19 01:47:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:47:34] [INFO ] After 5295ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-19 01:47:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:47:40] [INFO ] After 6220ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-19 01:47:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:47:59] [INFO ] After 18618ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-19 01:47:59] [INFO ] After 18618ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 01:47:59] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 271 ms.
Support contains 25 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 370 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 305/305 places, 7936/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 01:48:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:48:00] [INFO ] Invariant cache hit.
[2023-03-19 01:48:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:48:04] [INFO ] After 4076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 01:48:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:48:11] [INFO ] After 6715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 01:48:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:48:29] [INFO ] After 18150ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 01:48:29] [INFO ] After 18151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 01:48:29] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 185 ms.
Support contains 19 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 305 transition count 7878
Applied a total of 58 rules in 241 ms. Remains 305 /305 variables (removed 0) and now considering 7878/7936 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 305/305 places, 7878/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 133574 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133574 steps, saw 56177 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 01:48:33] [INFO ] Flow matrix only has 2674 transitions (discarded 5204 similar events)
// Phase 1: matrix 2674 rows 305 cols
[2023-03-19 01:48:33] [INFO ] Computed 1 place invariants in 34 ms
[2023-03-19 01:48:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:48:38] [INFO ] After 4353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 01:48:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:48:47] [INFO ] After 9019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 01:48:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:03] [INFO ] After 15857ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 01:49:03] [INFO ] After 15858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-19 01:49:03] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 99 ms.
Support contains 19 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7878/7878 transitions.
Applied a total of 0 rules in 268 ms. Remains 305 /305 variables (removed 0) and now considering 7878/7878 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 305/305 places, 7878/7878 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7878/7878 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7878/7878 (removed 0) transitions.
[2023-03-19 01:49:03] [INFO ] Flow matrix only has 2674 transitions (discarded 5204 similar events)
[2023-03-19 01:49:03] [INFO ] Invariant cache hit.
[2023-03-19 01:49:04] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-19 01:49:04] [INFO ] Flow matrix only has 2674 transitions (discarded 5204 similar events)
[2023-03-19 01:49:04] [INFO ] Invariant cache hit.
[2023-03-19 01:49:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:10] [INFO ] Implicit Places using invariants and state equation in 6589 ms returned []
Implicit Place search using SMT with State Equation took 6970 ms to find 0 implicit places.
[2023-03-19 01:49:11] [INFO ] Redundant transitions in 928 ms returned []
[2023-03-19 01:49:11] [INFO ] Flow matrix only has 2674 transitions (discarded 5204 similar events)
[2023-03-19 01:49:11] [INFO ] Invariant cache hit.
[2023-03-19 01:49:13] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10007 ms. Remains : 305/305 places, 7878/7878 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Szymanski-PT-b04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(p1)&&F(G(p0))))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 315 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:49:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:49:14] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 01:49:14] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 01:49:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:14] [INFO ] Invariant cache hit.
[2023-03-19 01:49:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:22] [INFO ] Implicit Places using invariants and state equation in 7676 ms returned []
Implicit Place search using SMT with State Equation took 8099 ms to find 0 implicit places.
[2023-03-19 01:49:23] [INFO ] Redundant transitions in 868 ms returned []
[2023-03-19 01:49:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:23] [INFO ] Invariant cache hit.
[2023-03-19 01:49:24] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11120 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 130 steps with 0 reset in 9 ms.
FORMULA Szymanski-PT-b04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-00 finished in 11375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:49:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:25] [INFO ] Invariant cache hit.
[2023-03-19 01:49:25] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-19 01:49:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:25] [INFO ] Invariant cache hit.
[2023-03-19 01:49:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:32] [INFO ] Implicit Places using invariants and state equation in 6596 ms returned []
Implicit Place search using SMT with State Equation took 6977 ms to find 0 implicit places.
[2023-03-19 01:49:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:32] [INFO ] Invariant cache hit.
[2023-03-19 01:49:34] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8894 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s3 1) (GEQ s300 1))) (GEQ s87 1) (GEQ s301 1)), p0:(AND (GEQ s124 1) (GEQ s258 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-01 finished in 9053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 25 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:49:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:34] [INFO ] Invariant cache hit.
[2023-03-19 01:49:34] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 01:49:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:34] [INFO ] Invariant cache hit.
[2023-03-19 01:49:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:42] [INFO ] Implicit Places using invariants and state equation in 7741 ms returned []
Implicit Place search using SMT with State Equation took 8153 ms to find 0 implicit places.
[2023-03-19 01:49:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:42] [INFO ] Invariant cache hit.
[2023-03-19 01:49:44] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10054 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-04 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:(AND (GEQ s24 1) (GEQ s282 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-04 finished in 10256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:49:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:44] [INFO ] Invariant cache hit.
[2023-03-19 01:49:45] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-19 01:49:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:45] [INFO ] Invariant cache hit.
[2023-03-19 01:49:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:49:52] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned []
Implicit Place search using SMT with State Equation took 7795 ms to find 0 implicit places.
[2023-03-19 01:49:53] [INFO ] Redundant transitions in 688 ms returned []
[2023-03-19 01:49:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:53] [INFO ] Invariant cache hit.
[2023-03-19 01:49:54] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10434 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s114 1) (GEQ s282 1)) (AND (GEQ s64 1) (GEQ s259 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 276 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-05 finished in 10589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(p0)&&p1)))'
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 25 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:49:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:55] [INFO ] Invariant cache hit.
[2023-03-19 01:49:55] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 01:49:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:49:55] [INFO ] Invariant cache hit.
[2023-03-19 01:49:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:50:02] [INFO ] Implicit Places using invariants and state equation in 6948 ms returned []
Implicit Place search using SMT with State Equation took 7362 ms to find 0 implicit places.
[2023-03-19 01:50:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:02] [INFO ] Invariant cache hit.
[2023-03-19 01:50:04] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9264 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s274 1)), p0:(AND (GEQ s58 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-06 finished in 9382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:50:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:04] [INFO ] Invariant cache hit.
[2023-03-19 01:50:05] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 01:50:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:05] [INFO ] Invariant cache hit.
[2023-03-19 01:50:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:50:13] [INFO ] Implicit Places using invariants and state equation in 8267 ms returned []
Implicit Place search using SMT with State Equation took 8683 ms to find 0 implicit places.
[2023-03-19 01:50:14] [INFO ] Redundant transitions in 838 ms returned []
[2023-03-19 01:50:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:14] [INFO ] Invariant cache hit.
[2023-03-19 01:50:16] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11652 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s260 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 458 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-07 finished in 12264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:50:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:16] [INFO ] Invariant cache hit.
[2023-03-19 01:50:17] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 01:50:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:17] [INFO ] Invariant cache hit.
[2023-03-19 01:50:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:50:24] [INFO ] Implicit Places using invariants and state equation in 7609 ms returned []
Implicit Place search using SMT with State Equation took 8034 ms to find 0 implicit places.
[2023-03-19 01:50:25] [INFO ] Redundant transitions in 890 ms returned []
[2023-03-19 01:50:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:25] [INFO ] Invariant cache hit.
[2023-03-19 01:50:27] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11021 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-08 finished in 11085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:50:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:27] [INFO ] Invariant cache hit.
[2023-03-19 01:50:28] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-19 01:50:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:28] [INFO ] Invariant cache hit.
[2023-03-19 01:50:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:50:35] [INFO ] Implicit Places using invariants and state equation in 6852 ms returned []
Implicit Place search using SMT with State Equation took 7236 ms to find 0 implicit places.
[2023-03-19 01:50:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:35] [INFO ] Invariant cache hit.
[2023-03-19 01:50:36] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9075 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 5 reset in 418 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 139792 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{1=1}
Probabilistic random walk after 139792 steps, saw 60321 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 01:50:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:50:41] [INFO ] Invariant cache hit.
[2023-03-19 01:50:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:50:49] [INFO ] After 8484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:50:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:50:55] [INFO ] After 5194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:50:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:51:05] [INFO ] After 10508ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:51:05] [INFO ] After 10731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 318 ms.
[2023-03-19 01:51:06] [INFO ] After 16321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 166389 steps, run timeout after 3009 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166389 steps, saw 58907 distinct states, run finished after 3009 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:51:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 01:51:09] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-19 01:51:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:51:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 01:51:18] [INFO ] After 8803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:51:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:51:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 01:51:20] [INFO ] After 2217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:51:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:51:29] [INFO ] After 9265ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 01:51:33] [INFO ] After 13250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9473 ms.
[2023-03-19 01:51:43] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 01:51:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:51:43] [INFO ] Invariant cache hit.
[2023-03-19 01:51:44] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-19 01:51:44] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:51:44] [INFO ] Invariant cache hit.
[2023-03-19 01:51:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:51:52] [INFO ] Implicit Places using invariants and state equation in 8183 ms returned []
Implicit Place search using SMT with State Equation took 8620 ms to find 0 implicit places.
[2023-03-19 01:51:53] [INFO ] Redundant transitions in 843 ms returned []
[2023-03-19 01:51:53] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:51:53] [INFO ] Invariant cache hit.
[2023-03-19 01:51:55] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11549 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4656 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 266 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 01:51:55] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-19 01:51:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:51:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:00] [INFO ] After 4642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:52:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 01:52:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:01] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:52:03] [INFO ] After 3364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3654 ms.
[2023-03-19 01:52:07] [INFO ] After 7078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 25 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:52:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:52:07] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 01:52:08] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 01:52:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:52:08] [INFO ] Invariant cache hit.
[2023-03-19 01:52:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:52:15] [INFO ] Implicit Places using invariants and state equation in 7601 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2023-03-19 01:52:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:52:15] [INFO ] Invariant cache hit.
[2023-03-19 01:52:17] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9797 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:52:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:52:18] [INFO ] Invariant cache hit.
[2023-03-19 01:52:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:19] [INFO ] After 1494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:52:19] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:22] [INFO ] After 2229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:52:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:52:26] [INFO ] After 4597ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:52:28] [INFO ] After 6103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1730 ms.
[2023-03-19 01:52:29] [INFO ] After 10125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197942 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197942 steps, saw 67942 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:52:33] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 01:52:33] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-19 01:52:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:52:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 01:52:34] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:52:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 01:52:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:35] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:52:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:52:42] [INFO ] After 7633ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:52:42] [INFO ] After 7756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-19 01:52:43] [INFO ] After 9142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 01:52:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:52:43] [INFO ] Invariant cache hit.
[2023-03-19 01:52:43] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 01:52:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:52:43] [INFO ] Invariant cache hit.
[2023-03-19 01:52:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:52:51] [INFO ] Implicit Places using invariants and state equation in 7611 ms returned []
Implicit Place search using SMT with State Equation took 8032 ms to find 0 implicit places.
[2023-03-19 01:52:52] [INFO ] Redundant transitions in 813 ms returned []
[2023-03-19 01:52:52] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:52:52] [INFO ] Invariant cache hit.
[2023-03-19 01:52:54] [INFO ] Dead Transitions using invariants and state equation in 1833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10874 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 200 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 01:52:54] [INFO ] Computed 2 place invariants in 28 ms
[2023-03-19 01:52:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:52:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:55] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:52:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 01:52:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:52:56] [INFO ] After 778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:52:56] [INFO ] After 1061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 598 ms.
[2023-03-19 01:52:57] [INFO ] After 1710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 385 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 385 ms.
Product exploration explored 100000 steps with 7 reset in 390 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:52:59] [INFO ] Redundant transitions in 802 ms returned []
[2023-03-19 01:52:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:52:59] [INFO ] Computed 1 place invariants in 31 ms
[2023-03-19 01:53:01] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2921 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 26 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:53:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:01] [INFO ] Invariant cache hit.
[2023-03-19 01:53:02] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-19 01:53:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:02] [INFO ] Invariant cache hit.
[2023-03-19 01:53:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:53:09] [INFO ] Implicit Places using invariants and state equation in 7173 ms returned []
Implicit Place search using SMT with State Equation took 7575 ms to find 0 implicit places.
[2023-03-19 01:53:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:09] [INFO ] Invariant cache hit.
[2023-03-19 01:53:11] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9382 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b04-LTLFireability-10 finished in 163704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 24 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:53:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:11] [INFO ] Invariant cache hit.
[2023-03-19 01:53:11] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-19 01:53:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:11] [INFO ] Invariant cache hit.
[2023-03-19 01:53:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:53:19] [INFO ] Implicit Places using invariants and state equation in 7543 ms returned []
Implicit Place search using SMT with State Equation took 7939 ms to find 0 implicit places.
[2023-03-19 01:53:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:19] [INFO ] Invariant cache hit.
[2023-03-19 01:53:21] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9824 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s292 1)), p0:(AND (GEQ s97 1) (GEQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-11 finished in 9935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:53:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:21] [INFO ] Invariant cache hit.
[2023-03-19 01:53:21] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 01:53:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:21] [INFO ] Invariant cache hit.
[2023-03-19 01:53:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:53:29] [INFO ] Implicit Places using invariants and state equation in 7655 ms returned []
Implicit Place search using SMT with State Equation took 8072 ms to find 0 implicit places.
[2023-03-19 01:53:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:29] [INFO ] Invariant cache hit.
[2023-03-19 01:53:31] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9881 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} 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}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s110 1) (GEQ s265 1)), p0:(AND (GEQ s67 1) (GEQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-13 finished in 10051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:53:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:31] [INFO ] Invariant cache hit.
[2023-03-19 01:53:32] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-19 01:53:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:32] [INFO ] Invariant cache hit.
[2023-03-19 01:53:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:53:39] [INFO ] Implicit Places using invariants and state equation in 7893 ms returned []
Implicit Place search using SMT with State Equation took 8293 ms to find 0 implicit places.
[2023-03-19 01:53:40] [INFO ] Redundant transitions in 774 ms returned []
[2023-03-19 01:53:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:40] [INFO ] Invariant cache hit.
[2023-03-19 01:53:42] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11070 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s83 1) (GEQ s285 1)), p1:(AND (GEQ s74 1) (GEQ s260 1)), p2:(AND (GEQ s84 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-15 finished in 11263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Found a Lengthening insensitive property : Szymanski-PT-b04-LTLFireability-10
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 44 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:53:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:43] [INFO ] Invariant cache hit.
[2023-03-19 01:53:43] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-19 01:53:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:43] [INFO ] Invariant cache hit.
[2023-03-19 01:53:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:53:50] [INFO ] Implicit Places using invariants and state equation in 7001 ms returned []
Implicit Place search using SMT with State Equation took 7399 ms to find 0 implicit places.
[2023-03-19 01:53:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:50] [INFO ] Invariant cache hit.
[2023-03-19 01:53:52] [INFO ] Dead Transitions using invariants and state equation in 1879 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9324 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 425 ms.
Product exploration explored 100000 steps with 4 reset in 438 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:53:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:53:53] [INFO ] Invariant cache hit.
[2023-03-19 01:53:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:02] [INFO ] After 8570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:54:02] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:07] [INFO ] After 5239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:54:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:54:22] [INFO ] After 14848ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:54:22] [INFO ] After 15140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-19 01:54:23] [INFO ] After 20868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:54:23] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 01:54:23] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-19 01:54:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:54:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:24] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:54:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:54:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:25] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:54:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:54:33] [INFO ] After 7717ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:54:33] [INFO ] After 7838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-19 01:54:33] [INFO ] After 9250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192098 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192098 steps, saw 67099 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:54:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:54:36] [INFO ] Invariant cache hit.
[2023-03-19 01:54:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:54:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:37] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:54:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 01:54:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:38] [INFO ] After 1184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:54:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:54:46] [INFO ] After 7726ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:54:46] [INFO ] After 7849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-19 01:54:46] [INFO ] After 9270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 01:54:47] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:54:47] [INFO ] Invariant cache hit.
[2023-03-19 01:54:47] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 01:54:47] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:54:47] [INFO ] Invariant cache hit.
[2023-03-19 01:54:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:54:55] [INFO ] Implicit Places using invariants and state equation in 7676 ms returned []
Implicit Place search using SMT with State Equation took 8107 ms to find 0 implicit places.
[2023-03-19 01:54:56] [INFO ] Redundant transitions in 815 ms returned []
[2023-03-19 01:54:56] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:54:56] [INFO ] Invariant cache hit.
[2023-03-19 01:54:58] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11004 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 209 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 01:54:58] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-19 01:54:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 01:54:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:54:59] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:54:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:54:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:55:00] [INFO ] After 793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:55:00] [INFO ] After 1084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 595 ms.
[2023-03-19 01:55:01] [INFO ] After 1732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 26 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:55:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:55:01] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 01:55:02] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-19 01:55:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:55:02] [INFO ] Invariant cache hit.
[2023-03-19 01:55:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:55:08] [INFO ] Implicit Places using invariants and state equation in 6459 ms returned []
Implicit Place search using SMT with State Equation took 6885 ms to find 0 implicit places.
[2023-03-19 01:55:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:55:08] [INFO ] Invariant cache hit.
[2023-03-19 01:55:10] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8830 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 144250 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{1=1}
Probabilistic random walk after 144250 steps, saw 61452 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 01:55:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:55:14] [INFO ] Invariant cache hit.
[2023-03-19 01:55:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:55:22] [INFO ] After 8573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:55:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:55:28] [INFO ] After 5255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:55:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:55:41] [INFO ] After 13422ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:55:43] [INFO ] After 15031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 01:55:43] [INFO ] After 20478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 159662 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159662 steps, saw 57960 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:55:46] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 01:55:46] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-19 01:55:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:55:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:55:55] [INFO ] After 8860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:55:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:55:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 01:55:57] [INFO ] After 2241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:55:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:56:07] [INFO ] After 9449ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 01:56:11] [INFO ] After 13464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9229 ms.
[2023-03-19 01:56:20] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 01:56:20] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:56:20] [INFO ] Invariant cache hit.
[2023-03-19 01:56:21] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 01:56:21] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:56:21] [INFO ] Invariant cache hit.
[2023-03-19 01:56:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:56:30] [INFO ] Implicit Places using invariants and state equation in 8906 ms returned []
Implicit Place search using SMT with State Equation took 9332 ms to find 0 implicit places.
[2023-03-19 01:56:30] [INFO ] Redundant transitions in 785 ms returned []
[2023-03-19 01:56:30] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:56:30] [INFO ] Invariant cache hit.
[2023-03-19 01:56:32] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12113 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4656 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 192 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 01:56:32] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-19 01:56:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:56:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:56:37] [INFO ] After 4702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:56:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:56:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:56:39] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:56:41] [INFO ] After 3374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3611 ms.
[2023-03-19 01:56:44] [INFO ] After 7042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 9 reset in 384 ms.
Product exploration explored 100000 steps with 1 reset in 388 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:56:47] [INFO ] Redundant transitions in 789 ms returned []
[2023-03-19 01:56:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:56:47] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 01:56:49] [INFO ] Dead Transitions using invariants and state equation in 1919 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2913 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 23 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:56:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:56:49] [INFO ] Invariant cache hit.
[2023-03-19 01:56:49] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-19 01:56:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:56:49] [INFO ] Invariant cache hit.
[2023-03-19 01:56:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:56:56] [INFO ] Implicit Places using invariants and state equation in 7195 ms returned []
Implicit Place search using SMT with State Equation took 7596 ms to find 0 implicit places.
[2023-03-19 01:56:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:56:56] [INFO ] Invariant cache hit.
[2023-03-19 01:56:58] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9392 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b04-LTLFireability-10 finished in 196137 ms.
[2023-03-19 01:56:59] [INFO ] Flatten gal took : 205 ms
[2023-03-19 01:56:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 01:56:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 43 ms.
Total runtime 581958 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Szymanski-PT-b04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1679191080525

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Szymanski-PT-b04-LTLFireability-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 3/32 Szymanski-PT-b04-LTLFireability-10 287773 m, 57554 m/sec, 809056 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 6/32 Szymanski-PT-b04-LTLFireability-10 621203 m, 66686 m/sec, 1896051 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 9/32 Szymanski-PT-b04-LTLFireability-10 985139 m, 72787 m/sec, 2855013 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 11/32 Szymanski-PT-b04-LTLFireability-10 1330353 m, 69042 m/sec, 3859276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 14/32 Szymanski-PT-b04-LTLFireability-10 1639936 m, 61916 m/sec, 4999987 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 16/32 Szymanski-PT-b04-LTLFireability-10 1955684 m, 63149 m/sec, 6090475 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 19/32 Szymanski-PT-b04-LTLFireability-10 2323323 m, 73527 m/sec, 6987514 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 22/32 Szymanski-PT-b04-LTLFireability-10 2694510 m, 74237 m/sec, 7850562 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 25/32 Szymanski-PT-b04-LTLFireability-10 3046199 m, 70337 m/sec, 8777101 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 28/32 Szymanski-PT-b04-LTLFireability-10 3408680 m, 72496 m/sec, 9645040 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 31/32 Szymanski-PT-b04-LTLFireability-10 3755044 m, 69272 m/sec, 10562938 t fired, .

Time elapsed: 55 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Szymanski-PT-b04-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b04-LTLFireability-10: 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: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Szymanski-PT-b04-LTLFireability-10: 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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r487-tall-167912703100460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 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 ;