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.r103-tall-167814478300452.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 DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30b-LTLFireability-00
FORMULA_NAME DES-PT-30b-LTLFireability-01
FORMULA_NAME DES-PT-30b-LTLFireability-02
FORMULA_NAME DES-PT-30b-LTLFireability-03
FORMULA_NAME DES-PT-30b-LTLFireability-04
FORMULA_NAME DES-PT-30b-LTLFireability-05
FORMULA_NAME DES-PT-30b-LTLFireability-06
FORMULA_NAME DES-PT-30b-LTLFireability-07
FORMULA_NAME DES-PT-30b-LTLFireability-08
FORMULA_NAME DES-PT-30b-LTLFireability-09
FORMULA_NAME DES-PT-30b-LTLFireability-10
FORMULA_NAME DES-PT-30b-LTLFireability-11
FORMULA_NAME DES-PT-30b-LTLFireability-12
FORMULA_NAME DES-PT-30b-LTLFireability-13
FORMULA_NAME DES-PT-30b-LTLFireability-14
FORMULA_NAME DES-PT-30b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678252528666

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=DES-PT-30b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:15:30] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-08 05:15:30] [INFO ] Transformed 399 places.
[2023-03-08 05:15:30] [INFO ] Transformed 350 transitions.
[2023-03-08 05:15:30] [INFO ] Found NUPN structural information;
[2023-03-08 05:15:30] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-30b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 376 transition count 330
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 376 transition count 330
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 364 transition count 318
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 364 transition count 318
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 77 place count 364 transition count 308
Applied a total of 77 rules in 92 ms. Remains 364 /399 variables (removed 35) and now considering 308/350 (removed 42) transitions.
// Phase 1: matrix 308 rows 364 cols
[2023-03-08 05:15:30] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-08 05:15:30] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-08 05:15:30] [INFO ] Invariant cache hit.
[2023-03-08 05:15:31] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-08 05:15:31] [INFO ] Invariant cache hit.
[2023-03-08 05:15:31] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 364/399 places, 308/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1052 ms. Remains : 364/399 places, 308/350 transitions.
Support contains 47 out of 364 places after structural reductions.
[2023-03-08 05:15:31] [INFO ] Flatten gal took : 63 ms
[2023-03-08 05:15:31] [INFO ] Flatten gal took : 23 ms
[2023-03-08 05:15:31] [INFO ] Input system was already deterministic with 308 transitions.
Support contains 46 out of 364 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 33) seen :20
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 05:15:32] [INFO ] Invariant cache hit.
[2023-03-08 05:15:33] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:15:33] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-08 05:15:33] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 05:15:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:15:33] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-08 05:15:33] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 4 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 521 ms
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 05:15:34] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2023-03-08 05:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-08 05:15:35] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-08 05:15:35] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:15:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-08 05:15:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-08 05:15:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-08 05:15:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2023-03-08 05:15:35] [INFO ] After 1993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-08 05:15:35] [INFO ] After 2584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 1077 ms.
Support contains 18 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 358 transition count 288
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 343 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 342 transition count 286
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 36 place count 342 transition count 278
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 52 place count 334 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 330 transition count 274
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 330 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 330 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 330 transition count 272
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 329 transition count 272
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 66 place count 326 transition count 269
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 326 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 326 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 71 place count 326 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 324 transition count 265
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 223 place count 250 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 248 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 247 transition count 192
Applied a total of 228 rules in 97 ms. Remains 247 /364 variables (removed 117) and now considering 192/308 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 247/364 places, 192/308 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 645554 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645554 steps, saw 88040 distinct states, run finished after 3005 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 192 rows 247 cols
[2023-03-08 05:15:40] [INFO ] Computed 61 place invariants in 9 ms
[2023-03-08 05:15:40] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 05:15:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:15:40] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 05:15:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 05:15:41] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-08 05:15:41] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 05:15:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:15:41] [INFO ] After 197ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2023-03-08 05:15:42] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-08 05:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-08 05:15:42] [INFO ] After 653ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-08 05:15:42] [INFO ] After 1370ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 544 ms.
Support contains 16 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 192/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 246 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 246 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 242 transition count 188
Applied a total of 8 rules in 31 ms. Remains 242 /247 variables (removed 5) and now considering 188/192 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 242/247 places, 188/192 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 655243 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 655243 steps, saw 89512 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 188 rows 242 cols
[2023-03-08 05:15:46] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:15:46] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:15:47] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 05:15:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:15:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-08 05:15:47] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 05:15:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:15:47] [INFO ] After 164ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-08 05:15:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 05:15:47] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-08 05:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 05:15:48] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-08 05:15:48] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 316 ms.
Support contains 16 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-08 05:15:48] [INFO ] Invariant cache hit.
[2023-03-08 05:15:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 05:15:48] [INFO ] Invariant cache hit.
[2023-03-08 05:15:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:15:49] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 05:15:49] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:15:49] [INFO ] Invariant cache hit.
[2023-03-08 05:15:49] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-03-08 05:15:49] [INFO ] Invariant cache hit.
[2023-03-08 05:15:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:15:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:15:49] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 05:15:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:15:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2023-03-08 05:15:49] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 05:15:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 05:15:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 05:15:50] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-08 05:15:50] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 181 stabilizing places and 173 stable transitions
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 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)&&(X(X((X(p1) U p0)))||X(X(p2)))))'
Support contains 6 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 357 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 357 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 353 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 353 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 353 transition count 293
Applied a total of 26 rules in 18 ms. Remains 353 /364 variables (removed 11) and now considering 293/308 (removed 15) transitions.
// Phase 1: matrix 293 rows 353 cols
[2023-03-08 05:15:50] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 05:15:50] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-08 05:15:50] [INFO ] Invariant cache hit.
[2023-03-08 05:15:51] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-08 05:15:51] [INFO ] Invariant cache hit.
[2023-03-08 05:15:51] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/364 places, 293/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 353/364 places, 293/308 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-30b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s244 1) (EQ s273 1)), p2:(AND (EQ s73 1) (EQ s202 1)), p1:(AND (EQ s125 1) (EQ s142 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-00 finished in 1287 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) U X((p1||F((X(F(p1))&&p2))))))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 357 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 357 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 353 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 353 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 353 transition count 293
Applied a total of 26 rules in 19 ms. Remains 353 /364 variables (removed 11) and now considering 293/308 (removed 15) transitions.
[2023-03-08 05:15:51] [INFO ] Invariant cache hit.
[2023-03-08 05:15:52] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 05:15:52] [INFO ] Invariant cache hit.
[2023-03-08 05:15:52] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-08 05:15:52] [INFO ] Invariant cache hit.
[2023-03-08 05:15:52] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/364 places, 293/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 353/364 places, 293/308 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s112 1) (EQ s142 1)), p1:(EQ s147 1), p2:(AND (EQ s79 1) (EQ s202 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 2 ms.
FORMULA DES-PT-30b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-01 finished in 932 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((p0||F(p1))))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 358 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 358 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 358 transition count 301
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 354 transition count 297
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 354 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 354 transition count 295
Applied a total of 23 rules in 20 ms. Remains 354 /364 variables (removed 10) and now considering 295/308 (removed 13) transitions.
// Phase 1: matrix 295 rows 354 cols
[2023-03-08 05:15:52] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 05:15:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:15:53] [INFO ] Invariant cache hit.
[2023-03-08 05:15:53] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-08 05:15:53] [INFO ] Invariant cache hit.
[2023-03-08 05:15:53] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/364 places, 295/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 354/364 places, 295/308 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s146 1) (AND (EQ s146 1) (EQ s96 1) (EQ s142 1))), p0:(EQ s167 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/354 stabilizing places and 168/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30b-LTLFireability-02 finished in 1453 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(((p1&&G(F(p2)))||p0)))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 357 transition count 288
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 341 transition count 287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 341 transition count 277
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 331 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 327 transition count 273
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 327 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 327 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 327 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 326 transition count 271
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 323 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 323 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 323 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 73 place count 323 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 321 transition count 264
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 221 place count 249 transition count 192
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 246 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 244 transition count 198
Applied a total of 229 rules in 74 ms. Remains 244 /364 variables (removed 120) and now considering 198/308 (removed 110) transitions.
// Phase 1: matrix 198 rows 244 cols
[2023-03-08 05:15:54] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:15:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:15:54] [INFO ] Invariant cache hit.
[2023-03-08 05:15:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:15:54] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 05:15:54] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 05:15:54] [INFO ] Invariant cache hit.
[2023-03-08 05:15:54] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/364 places, 198/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 244/364 places, 198/308 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s164 1) (NEQ s183 1)), p1:(OR (NEQ s108 1) (NEQ s124 1)), p2:(NEQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4268 reset in 372 ms.
Product exploration explored 100000 steps with 4288 reset in 298 ms.
Computed a total of 139 stabilizing places and 140 stable transitions
Computed a total of 139 stabilizing places and 140 stable transitions
Detected a total of 139/244 stabilizing places and 140/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 506 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 417 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:15:56] [INFO ] Invariant cache hit.
[2023-03-08 05:15:56] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 05:15:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:15:56] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:15:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 05:15:57] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 05:15:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:15:57] [INFO ] After 28ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-08 05:15:57] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 05:15:57] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 198/198 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 243 transition count 196
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 243 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 242 transition count 195
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 242 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 241 transition count 194
Applied a total of 7 rules in 30 ms. Remains 241 /244 variables (removed 3) and now considering 194/198 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 241/244 places, 194/198 transitions.
Incomplete random walk after 10000 steps, including 452 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 992403 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992403 steps, saw 137166 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 241 cols
[2023-03-08 05:16:00] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 05:16:00] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 05:16:00] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:16:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-08 05:16:00] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:00] [INFO ] After 30ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:00] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 05:16:00] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 194/194 transitions.
Applied a total of 0 rules in 12 ms. Remains 241 /241 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 241/241 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-08 05:16:00] [INFO ] Invariant cache hit.
[2023-03-08 05:16:01] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:16:01] [INFO ] Invariant cache hit.
[2023-03-08 05:16:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:01] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-08 05:16:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:16:01] [INFO ] Invariant cache hit.
[2023-03-08 05:16:01] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 241/241 places, 194/194 transitions.
Graph (complete) has 803 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 240 transition count 194
Applied a total of 2 rules in 12 ms. Remains 240 /241 variables (removed 1) and now considering 194/194 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 240 cols
[2023-03-08 05:16:01] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-08 05:16:01] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:01] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:01] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:16:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:16:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 05:16:01] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:01] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 05:16:01] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 766 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 198/198 transitions.
Applied a total of 0 rules in 11 ms. Remains 244 /244 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 244 cols
[2023-03-08 05:16:02] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:16:03] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:16:03] [INFO ] Invariant cache hit.
[2023-03-08 05:16:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:03] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-08 05:16:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:16:03] [INFO ] Invariant cache hit.
[2023-03-08 05:16:03] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 244/244 places, 198/198 transitions.
Computed a total of 139 stabilizing places and 140 stable transitions
Computed a total of 139 stabilizing places and 140 stable transitions
Detected a total of 139/244 stabilizing places and 140/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 4 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 416 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:16:04] [INFO ] Invariant cache hit.
[2023-03-08 05:16:04] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:16:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:16:04] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:04] [INFO ] After 23ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:04] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:16:04] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 198/198 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 243 transition count 196
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 243 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 242 transition count 195
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 242 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 241 transition count 194
Applied a total of 7 rules in 30 ms. Remains 241 /244 variables (removed 3) and now considering 194/198 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 241/244 places, 194/198 transitions.
Incomplete random walk after 10000 steps, including 434 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1004349 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1004349 steps, saw 138640 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 241 cols
[2023-03-08 05:16:07] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:16:07] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:07] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:16:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 05:16:08] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:08] [INFO ] After 29ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:08] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:16:08] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 241/241 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-08 05:16:08] [INFO ] Invariant cache hit.
[2023-03-08 05:16:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 05:16:08] [INFO ] Invariant cache hit.
[2023-03-08 05:16:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:08] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-08 05:16:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:08] [INFO ] Invariant cache hit.
[2023-03-08 05:16:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 561 ms. Remains : 241/241 places, 194/194 transitions.
Graph (complete) has 803 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 240 transition count 194
Applied a total of 2 rules in 10 ms. Remains 240 /241 variables (removed 1) and now considering 194/194 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 194 rows 240 cols
[2023-03-08 05:16:08] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-08 05:16:08] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 05:16:08] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:16:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 05:16:09] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:16:09] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 05:16:09] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 532 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 4 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4282 reset in 259 ms.
Product exploration explored 100000 steps with 4218 reset in 278 ms.
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 244 cols
[2023-03-08 05:16:10] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:16:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 05:16:10] [INFO ] Invariant cache hit.
[2023-03-08 05:16:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:11] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 05:16:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:11] [INFO ] Invariant cache hit.
[2023-03-08 05:16:11] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 244/244 places, 198/198 transitions.
Treatment of property DES-PT-30b-LTLFireability-03 finished in 16904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 357 transition count 288
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 341 transition count 287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 341 transition count 277
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 331 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 327 transition count 273
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 327 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 327 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 327 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 326 transition count 271
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 323 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 323 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 323 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 73 place count 323 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 321 transition count 264
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 227 place count 246 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 243 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 241 transition count 195
Applied a total of 235 rules in 69 ms. Remains 241 /364 variables (removed 123) and now considering 195/308 (removed 113) transitions.
// Phase 1: matrix 195 rows 241 cols
[2023-03-08 05:16:11] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-08 05:16:11] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-08 05:16:11] [INFO ] Invariant cache hit.
[2023-03-08 05:16:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:11] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-08 05:16:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:11] [INFO ] Invariant cache hit.
[2023-03-08 05:16:11] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/364 places, 195/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 241/364 places, 195/308 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s110 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4893 reset in 233 ms.
Product exploration explored 100000 steps with 4883 reset in 258 ms.
Computed a total of 137 stabilizing places and 138 stable transitions
Computed a total of 137 stabilizing places and 138 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 488 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1643752 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :{}
Probabilistic random walk after 1643752 steps, saw 225031 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:16:15] [INFO ] Invariant cache hit.
[2023-03-08 05:16:15] [INFO ] [Real]Absence check using 34 positive place invariants in 3 ms returned sat
[2023-03-08 05:16:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:15] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:16:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 05:16:15] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:15] [INFO ] After 26ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:15] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:16:15] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 195/195 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 241 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 240 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 240 transition count 193
Applied a total of 4 rules in 16 ms. Remains 240 /241 variables (removed 1) and now considering 193/195 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 240/241 places, 193/195 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1621554 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :{}
Probabilistic random walk after 1621554 steps, saw 221841 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 240 cols
[2023-03-08 05:16:19] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:16:19] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 05:16:19] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2023-03-08 05:16:19] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:19] [INFO ] After 139ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:19] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 05:16:19] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 240/240 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-08 05:16:19] [INFO ] Invariant cache hit.
[2023-03-08 05:16:19] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 05:16:19] [INFO ] Invariant cache hit.
[2023-03-08 05:16:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:20] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-08 05:16:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:20] [INFO ] Invariant cache hit.
[2023-03-08 05:16:20] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 240/240 places, 193/193 transitions.
Graph (complete) has 810 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 239 transition count 193
Applied a total of 2 rules in 7 ms. Remains 239 /240 variables (removed 1) and now considering 193/193 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 239 cols
[2023-03-08 05:16:20] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:16:20] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:20] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:16:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 44 ms returned sat
[2023-03-08 05:16:20] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:20] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 05:16:20] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 195/195 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 241 cols
[2023-03-08 05:16:20] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:16:20] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 05:16:20] [INFO ] Invariant cache hit.
[2023-03-08 05:16:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:21] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-08 05:16:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:16:21] [INFO ] Invariant cache hit.
[2023-03-08 05:16:21] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 241/241 places, 195/195 transitions.
Computed a total of 137 stabilizing places and 138 stable transitions
Computed a total of 137 stabilizing places and 138 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 483 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1648240 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1648240 steps, saw 225689 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:16:24] [INFO ] Invariant cache hit.
[2023-03-08 05:16:24] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:24] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 3 ms returned sat
[2023-03-08 05:16:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 05:16:24] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:24] [INFO ] After 28ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:24] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:16:24] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 195/195 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 241 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 240 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 240 transition count 193
Applied a total of 4 rules in 16 ms. Remains 240 /241 variables (removed 1) and now considering 193/195 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 240/241 places, 193/195 transitions.
Incomplete random walk after 10000 steps, including 458 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1640361 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1640361 steps, saw 224469 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 240 cols
[2023-03-08 05:16:27] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:16:27] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:27] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:16:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2023-03-08 05:16:28] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:28] [INFO ] After 142ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:28] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 05:16:28] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 193/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 193/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-08 05:16:28] [INFO ] Invariant cache hit.
[2023-03-08 05:16:28] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 05:16:28] [INFO ] Invariant cache hit.
[2023-03-08 05:16:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:28] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-08 05:16:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:28] [INFO ] Invariant cache hit.
[2023-03-08 05:16:29] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 240/240 places, 193/193 transitions.
Graph (complete) has 810 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 239 transition count 193
Applied a total of 2 rules in 7 ms. Remains 239 /240 variables (removed 1) and now considering 193/193 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 239 cols
[2023-03-08 05:16:29] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:16:29] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:16:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:16:29] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:16:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 05:16:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 05:16:29] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:16:29] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 05:16:29] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4871 reset in 248 ms.
Product exploration explored 100000 steps with 4874 reset in 258 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 195/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 241 cols
[2023-03-08 05:16:30] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:16:30] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 05:16:30] [INFO ] Invariant cache hit.
[2023-03-08 05:16:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:30] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-08 05:16:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:30] [INFO ] Invariant cache hit.
[2023-03-08 05:16:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 241/241 places, 195/195 transitions.
Treatment of property DES-PT-30b-LTLFireability-04 finished in 19477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((G(p1)&&p0) U p2) U (p3||G(!p4))))))'
Support contains 7 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 357 transition count 288
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 341 transition count 287
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 34 place count 341 transition count 279
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 333 transition count 279
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 329 transition count 275
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 329 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 329 transition count 274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 329 transition count 273
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 328 transition count 273
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 325 transition count 270
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 325 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 325 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 325 transition count 266
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 323 transition count 266
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 223 place count 248 transition count 191
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 245 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 244 transition count 198
Applied a total of 230 rules in 48 ms. Remains 244 /364 variables (removed 120) and now considering 198/308 (removed 110) transitions.
// Phase 1: matrix 198 rows 244 cols
[2023-03-08 05:16:30] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:16:30] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 05:16:30] [INFO ] Invariant cache hit.
[2023-03-08 05:16:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:31] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 05:16:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:31] [INFO ] Invariant cache hit.
[2023-03-08 05:16:31] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/364 places, 198/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 244/364 places, 198/308 transitions.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p3) p4), (AND (NOT p3) p4), (AND (NOT p1) (NOT p3) p4), (AND (NOT p2) (NOT p3) p4), (AND (NOT p3) p4), (AND (NOT p1) (NOT p3) p4), (AND (NOT p2) (NOT p3) p4), (AND (NOT p1) (NOT p3) p4)]
Running random walk in product with property : DES-PT-30b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p3 (NOT p4) p2 (AND p0 p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p4 (NOT p2) (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p1))), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={2} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p0 p1)), acceptance={1, 2} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p4 p2) (AND (NOT p3) p4 p0 p1)), acceptance={0, 1, 2} source=0 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 2} source=0 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 1, 2} source=0 dest: 6}], [{ cond=(OR (AND p3 p4) (AND p4 p2) (AND p4 p0 p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p4 (NOT p2) (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (AND p3 (NOT p4)) (AND (NOT p4) p2) (AND (NOT p4) p0 p1)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p1))), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={2} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={1, 2} source=1 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p0 p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(OR (AND (NOT p3) p4 p2) (AND (NOT p3) p4 p0 p1)), acceptance={0, 1, 2} source=1 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 2} source=1 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 1, 2} source=1 dest: 6}], [{ cond=(OR (AND p3 p4 (NOT p1)) (AND p4 p2 (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) p4 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(OR (AND p3 (NOT p4) (NOT p1)) (AND (NOT p4) p2 (NOT p1))), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p4) p1) (AND (NOT p4) p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p4) p2 (NOT p1)), acceptance={1, 2} source=2 dest: 4}, { cond=(AND (NOT p3) p4 p2 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(OR (AND p3 p4 p1) (AND p4 p2 p1)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p1), acceptance={0, 2} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p4) p2 p1), acceptance={2} source=2 dest: 7}, { cond=(AND (NOT p3) p4 p2 p1), acceptance={0, 2} source=2 dest: 7}], [{ cond=(OR (AND p3 p4 (NOT p2) (NOT p0)) (AND p3 p4 (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND (NOT p3) p4 (NOT p2) (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(OR (AND p3 (NOT p4) (NOT p2) (NOT p0)) (AND p3 (NOT p4) (NOT p2) (NOT p1))), acceptance={1} source=3 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p1))), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p3 (NOT p4) (NOT p2) p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={2} source=3 dest: 2}, { cond=(AND p3 (NOT p4) (NOT p2) p0 p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p3 p4 (NOT p2) p0 p1), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 2} source=3 dest: 5}, { cond=(AND p3 p4 (NOT p2) p0 p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 1, 2} source=3 dest: 6}], [{ cond=(OR (AND (NOT p3) p4 (NOT p2) (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p1))), acceptance={1, 2} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={2} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={1, 2} source=4 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p0 p1)), acceptance={1, 2} source=4 dest: 4}, { cond=(OR (AND (NOT p3) p4 p2) (AND (NOT p3) p4 p0 p1)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 1, 2} source=4 dest: 6}], [{ cond=(OR (AND p3 (NOT p1)) (AND (NOT p4) (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p3) p4 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={2} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p4) p2 (NOT p1)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND (NOT p3) p4 p2 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(OR (AND p3 p1) (AND (NOT p4) p1) (AND p2 p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p1), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p4) p2 p1), acceptance={2} source=5 dest: 7}, { cond=(AND (NOT p3) p4 p2 p1), acceptance={0, 2} source=5 dest: 7}], [{ cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1)) (AND (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p2) (NOT p1))), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND (NOT p3) p4 (NOT p2) (NOT p0)) (AND (NOT p3) p4 (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p4) (NOT p2) (NOT p1))), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={2} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p0 p1), acceptance={1, 2} source=6 dest: 3}, { cond=(OR (AND p3 (NOT p2) p0 p1) (AND (NOT p4) (NOT p2) p0 p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 2} source=6 dest: 5}, { cond=(OR (AND p3 (NOT p2) p0 p1) (AND (NOT p4) (NOT p2) p0 p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p2) p0 p1), acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p3) p4 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={1, 2} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={2} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p4) p2 (NOT p1)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND (NOT p3) p4 p2 (NOT p1)), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p3) p4 (NOT p2) p1), acceptance={0, 2} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p4) p2 p1), acceptance={2} source=7 dest: 7}, { cond=(AND (NOT p3) p4 p2 p1), acceptance={0, 2} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s94 1) (EQ s125 1)), p4:(OR (NEQ s111 1) (NEQ s125 1)), p2:(AND (EQ s16 1) (EQ s157 1)), p0:(AND (EQ s90 1) (EQ s125 1)), p1:(EQ s142 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-06 finished in 1046 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((!p0 U (G(!p0)||(G(p1)&&(F(!p2)||G(!p1)))))))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 357 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 357 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 353 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 353 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 353 transition count 293
Applied a total of 26 rules in 17 ms. Remains 353 /364 variables (removed 11) and now considering 293/308 (removed 15) transitions.
// Phase 1: matrix 293 rows 353 cols
[2023-03-08 05:16:31] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-08 05:16:31] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 05:16:31] [INFO ] Invariant cache hit.
[2023-03-08 05:16:32] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-08 05:16:32] [INFO ] Invariant cache hit.
[2023-03-08 05:16:32] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/364 places, 293/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 353/364 places, 293/308 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1)), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s203 1), p2:(AND (EQ s37 1) (EQ s345 1)), p0:(AND (EQ s162 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2988 steps with 25 reset in 9 ms.
FORMULA DES-PT-30b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-07 finished in 803 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((G(F(p0))||G(p1)))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 357 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 357 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 353 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 353 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 353 transition count 293
Applied a total of 26 rules in 18 ms. Remains 353 /364 variables (removed 11) and now considering 293/308 (removed 15) transitions.
[2023-03-08 05:16:32] [INFO ] Invariant cache hit.
[2023-03-08 05:16:32] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 05:16:32] [INFO ] Invariant cache hit.
[2023-03-08 05:16:33] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-08 05:16:33] [INFO ] Invariant cache hit.
[2023-03-08 05:16:33] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/364 places, 293/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 353/364 places, 293/308 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s141 1), p0:(AND (EQ s45 1) (EQ s345 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-08 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 357 transition count 288
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 341 transition count 287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 341 transition count 277
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 331 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 327 transition count 273
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 327 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 327 transition count 272
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 324 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 324 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 324 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 71 place count 324 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 322 transition count 265
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 227 place count 246 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 243 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 241 transition count 195
Applied a total of 235 rules in 44 ms. Remains 241 /364 variables (removed 123) and now considering 195/308 (removed 113) transitions.
// Phase 1: matrix 195 rows 241 cols
[2023-03-08 05:16:33] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:16:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 05:16:33] [INFO ] Invariant cache hit.
[2023-03-08 05:16:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 05:16:33] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-08 05:16:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:33] [INFO ] Invariant cache hit.
[2023-03-08 05:16:33] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/364 places, 195/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 241/364 places, 195/308 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-09 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 p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s130 1), p1:(EQ s220 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 457 steps with 80 reset in 5 ms.
FORMULA DES-PT-30b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-09 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Graph (complete) has 788 edges and 364 vertex of which 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 357 transition count 288
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 341 transition count 287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 341 transition count 277
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 331 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 327 transition count 273
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 327 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 327 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 327 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 326 transition count 271
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 323 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 323 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 323 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 73 place count 323 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 321 transition count 264
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 227 place count 246 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 243 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 241 transition count 195
Applied a total of 235 rules in 40 ms. Remains 241 /364 variables (removed 123) and now considering 195/308 (removed 113) transitions.
// Phase 1: matrix 195 rows 241 cols
[2023-03-08 05:16:34] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:16:34] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 05:16:34] [INFO ] Invariant cache hit.
[2023-03-08 05:16:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 05:16:34] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 05:16:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:16:34] [INFO ] Invariant cache hit.
[2023-03-08 05:16:34] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/364 places, 195/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 562 ms. Remains : 241/364 places, 195/308 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s104 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-10 finished in 615 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)&&X(G(p1))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 358 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 358 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 358 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 355 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 355 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 355 transition count 296
Applied a total of 21 rules in 20 ms. Remains 355 /364 variables (removed 9) and now considering 296/308 (removed 12) transitions.
// Phase 1: matrix 296 rows 355 cols
[2023-03-08 05:16:34] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:16:34] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 05:16:34] [INFO ] Invariant cache hit.
[2023-03-08 05:16:35] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-08 05:16:35] [INFO ] Invariant cache hit.
[2023-03-08 05:16:35] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/364 places, 296/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 355/364 places, 296/308 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s86 0) (EQ s204 0)), p0:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 223 steps with 1 reset in 2 ms.
FORMULA DES-PT-30b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-11 finished in 774 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((((X(p0)||X(p1)) U !p0)&&G(p2)))))'
Support contains 9 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 357 transition count 301
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 357 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 353 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 353 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 353 transition count 293
Applied a total of 26 rules in 21 ms. Remains 353 /364 variables (removed 11) and now considering 293/308 (removed 15) transitions.
// Phase 1: matrix 293 rows 353 cols
[2023-03-08 05:16:35] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:16:35] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 05:16:35] [INFO ] Invariant cache hit.
[2023-03-08 05:16:35] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-08 05:16:35] [INFO ] Invariant cache hit.
[2023-03-08 05:16:36] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/364 places, 293/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 353/364 places, 293/308 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (OR (NOT p2) p0), (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), true]
Running random walk in product with property : DES-PT-30b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (EQ s88 1) (EQ s202 1)), p0:(AND (EQ s70 1) (EQ s202 1)), p1:(AND (EQ s134 1) (EQ s138 1) (EQ s148 1) (EQ s149 1) (EQ s153 1) (EQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-12 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||G(p2)))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 359 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 359 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 359 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 357 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 357 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 357 transition count 298
Applied a total of 17 rules in 16 ms. Remains 357 /364 variables (removed 7) and now considering 298/308 (removed 10) transitions.
// Phase 1: matrix 298 rows 357 cols
[2023-03-08 05:16:36] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 05:16:36] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 05:16:36] [INFO ] Invariant cache hit.
[2023-03-08 05:16:36] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-08 05:16:36] [INFO ] Invariant cache hit.
[2023-03-08 05:16:36] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 357/364 places, 298/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 357/364 places, 298/308 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-30b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s199 1), p2:(EQ s195 1), p1:(EQ s343 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-13 finished in 860 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(p0)))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 308/308 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 358 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 358 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 358 transition count 301
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 354 transition count 297
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 354 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 354 transition count 295
Applied a total of 23 rules in 18 ms. Remains 354 /364 variables (removed 10) and now considering 295/308 (removed 13) transitions.
// Phase 1: matrix 295 rows 354 cols
[2023-03-08 05:16:37] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:16:37] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 05:16:37] [INFO ] Invariant cache hit.
[2023-03-08 05:16:37] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-08 05:16:37] [INFO ] Invariant cache hit.
[2023-03-08 05:16:37] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/364 places, 295/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 354/364 places, 295/308 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (EQ s156 1) (EQ s336 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-14 finished in 766 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(((p1&&G(F(p2)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-08 05:16:38] [INFO ] Flatten gal took : 19 ms
[2023-03-08 05:16:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 05:16:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 364 places, 308 transitions and 1035 arcs took 2 ms.
Total runtime 67911 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-30b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678252629354

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-30b-LTLFireability-03
lola: time limit : 1800 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
DES-PT-30b-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
DES-PT-30b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 16/32 DES-PT-30b-LTLFireability-03 1975121 m, 395024 m/sec, 2511958 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30b-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
DES-PT-30b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 32/32 DES-PT-30b-LTLFireability-03 4065311 m, 418038 m/sec, 4948684 t fired, .

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for DES-PT-30b-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-30b-LTLFireability-04: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-30b-LTLFireability-04
lola: time limit : 3585 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
DES-PT-30b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-30b-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3585 16/32 DES-PT-30b-LTLFireability-04 2020279 m, 404055 m/sec, 2576406 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-30b-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3585 32/32 DES-PT-30b-LTLFireability-04 4120443 m, 420032 m/sec, 5062829 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for DES-PT-30b-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30b-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
DES-PT-30b-LTLFireability-04: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30b-LTLFireability-03: LTL unknown AGGR
DES-PT-30b-LTLFireability-04: LTL unknown AGGR


Time elapsed: 30 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="DES-PT-30b"
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 DES-PT-30b, 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 r103-tall-167814478300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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