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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 115K 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-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678305190408

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:53:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 19:53:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:53:12] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-08 19:53:12] [INFO ] Transformed 439 places.
[2023-03-08 19:53:12] [INFO ] Transformed 390 transitions.
[2023-03-08 19:53:12] [INFO ] Found NUPN structural information;
[2023-03-08 19:53:12] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-40b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 415 transition count 369
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 415 transition count 369
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 402 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 402 transition count 356
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 402 transition count 347
Applied a total of 80 rules in 90 ms. Remains 402 /439 variables (removed 37) and now considering 347/390 (removed 43) transitions.
// Phase 1: matrix 347 rows 402 cols
[2023-03-08 19:53:12] [INFO ] Computed 62 place invariants in 42 ms
[2023-03-08 19:53:13] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-08 19:53:13] [INFO ] Invariant cache hit.
[2023-03-08 19:53:13] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-08 19:53:13] [INFO ] Invariant cache hit.
[2023-03-08 19:53:13] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/439 places, 347/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1173 ms. Remains : 402/439 places, 347/390 transitions.
Support contains 40 out of 402 places after structural reductions.
[2023-03-08 19:53:14] [INFO ] Flatten gal took : 54 ms
[2023-03-08 19:53:14] [INFO ] Flatten gal took : 25 ms
[2023-03-08 19:53:14] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 38 out of 402 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 19:53:14] [INFO ] Invariant cache hit.
[2023-03-08 19:53:15] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 19:53:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-08 19:53:15] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:53:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-08 19:53:15] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 4 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 347 ms
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 4 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2023-03-08 19:53:16] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-08 19:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-08 19:53:17] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2023-03-08 19:53:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-08 19:53:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-03-08 19:53:17] [INFO ] After 2049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 420 ms.
[2023-03-08 19:53:17] [INFO ] After 2708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1103 ms.
Support contains 13 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 396 transition count 328
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 382 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 382 transition count 317
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 371 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 367 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 367 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 63 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 366 transition count 311
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 363 transition count 308
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 363 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 74 place count 363 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 362 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 362 transition count 301
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 80 place count 360 transition count 301
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 226 place count 287 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 285 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 285 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 283 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 282 transition count 228
Applied a total of 234 rules in 150 ms. Remains 282 /402 variables (removed 120) and now considering 228/347 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 282/402 places, 228/347 transitions.
Incomplete random walk after 10000 steps, including 387 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 628818 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 628818 steps, saw 96362 distinct states, run finished after 3002 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 19:53:22] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 19:53:23] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 19:53:23] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:53:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 117 ms returned sat
[2023-03-08 19:53:23] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 19:53:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:23] [INFO ] After 206ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-08 19:53:23] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-08 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 19:53:24] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2023-03-08 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-08 19:53:24] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-08 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 19:53:24] [INFO ] After 759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-08 19:53:24] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 369 ms.
Support contains 13 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 282/282 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-08 19:53:24] [INFO ] Invariant cache hit.
[2023-03-08 19:53:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 19:53:25] [INFO ] Invariant cache hit.
[2023-03-08 19:53:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:25] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-08 19:53:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 19:53:25] [INFO ] Invariant cache hit.
[2023-03-08 19:53:25] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 631 ms. Remains : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-08 19:53:25] [INFO ] Invariant cache hit.
[2023-03-08 19:53:25] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 19:53:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 19:53:25] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 19:53:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:53:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 154 ms returned sat
[2023-03-08 19:53:26] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 19:53:26] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-08 19:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 19:53:26] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-08 19:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 19:53:26] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-08 19:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-08 19:53:26] [INFO ] After 798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-08 19:53:27] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 907 edges and 402 vertex of which 396 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' '!(X(X((G(p0) U X(X(G(p1)))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 24 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:53:27] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-08 19:53:27] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-08 19:53:27] [INFO ] Invariant cache hit.
[2023-03-08 19:53:28] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-08 19:53:28] [INFO ] Invariant cache hit.
[2023-03-08 19:53:28] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 946 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s182 1)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-00 finished in 1446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 398 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 398 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 398 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 396 transition count 340
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 396 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 395 transition count 336
Applied a total of 18 rules in 24 ms. Remains 395 /402 variables (removed 7) and now considering 336/347 (removed 11) transitions.
// Phase 1: matrix 336 rows 395 cols
[2023-03-08 19:53:28] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 19:53:29] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 19:53:29] [INFO ] Invariant cache hit.
[2023-03-08 19:53:29] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-08 19:53:29] [INFO ] Invariant cache hit.
[2023-03-08 19:53:29] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/402 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 885 ms. Remains : 395/402 places, 336/347 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-01 finished in 997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 32 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:53:29] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 19:53:29] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 19:53:30] [INFO ] Invariant cache hit.
[2023-03-08 19:53:30] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-08 19:53:30] [INFO ] Invariant cache hit.
[2023-03-08 19:53:30] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s305 1) (EQ s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 4 ms.
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-02 finished in 977 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(F((p0&&F(p1)))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 27 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 19:53:30] [INFO ] Invariant cache hit.
[2023-03-08 19:53:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 19:53:30] [INFO ] Invariant cache hit.
[2023-03-08 19:53:31] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-08 19:53:31] [INFO ] Invariant cache hit.
[2023-03-08 19:53:31] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s113 1) (EQ s242 1)), p0:(OR (EQ s76 0) (EQ s385 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 3 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 1039 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 ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 29 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 19:53:31] [INFO ] Invariant cache hit.
[2023-03-08 19:53:31] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 19:53:32] [INFO ] Invariant cache hit.
[2023-03-08 19:53:32] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-08 19:53:32] [INFO ] Invariant cache hit.
[2023-03-08 19:53:32] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s157 1) (EQ s182 1)), p0:(AND (EQ s84 1) (EQ s385 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 894 reset in 309 ms.
Product exploration explored 100000 steps with 888 reset in 261 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 328 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:53:34] [INFO ] Invariant cache hit.
[2023-03-08 19:53:34] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:34] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 40 ms returned sat
[2023-03-08 19:53:34] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:34] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-08 19:53:34] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:34] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-08 19:53:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-08 19:53:34] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 19:53:34] [INFO ] After 478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
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 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 61 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 441 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1539369 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1539369 steps, saw 210177 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 19:53:37] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 19:53:37] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 19:53:37] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-08 19:53:38] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:38] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:38] [INFO ] After 48ms 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 19:53:38] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 19:53:38] [INFO ] Invariant cache hit.
[2023-03-08 19:53:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 19:53:38] [INFO ] Invariant cache hit.
[2023-03-08 19:53:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:38] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-08 19:53:38] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 19:53:38] [INFO ] Invariant cache hit.
[2023-03-08 19:53:38] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 24 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 19:53:38] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 19:53:38] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:53:39] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 19:53:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-08 19:53:39] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:39] [INFO ] After 149ms 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 19:53:39] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 141 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:53:40] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 19:53:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 19:53:40] [INFO ] Invariant cache hit.
[2023-03-08 19:53:40] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-08 19:53:40] [INFO ] Invariant cache hit.
[2023-03-08 19:53:40] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:53:41] [INFO ] Invariant cache hit.
[2023-03-08 19:53:41] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:41] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-08 19:53:41] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 19:53:41] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-08 19:53:41] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:41] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-08 19:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-08 19:53:41] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 19:53:41] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
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 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 45 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 435 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1585504 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :{}
Probabilistic random walk after 1585504 steps, saw 216533 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 19:53:44] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 19:53:44] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:53:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2023-03-08 19:53:45] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:45] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:45] [INFO ] After 40ms 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 19:53:45] [INFO ] After 345ms 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 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 19:53:45] [INFO ] Invariant cache hit.
[2023-03-08 19:53:45] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 19:53:45] [INFO ] Invariant cache hit.
[2023-03-08 19:53:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 19:53:45] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-08 19:53:45] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 19:53:45] [INFO ] Invariant cache hit.
[2023-03-08 19:53:45] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 9 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 19:53:45] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 19:53:45] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:53:45] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:53:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 85 ms returned sat
[2023-03-08 19:53:46] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:53:46] [INFO ] After 151ms 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 19:53:46] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 142 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 148 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 883 reset in 186 ms.
Product exploration explored 100000 steps with 883 reset in 218 ms.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:53:47] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 19:53:47] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 19:53:47] [INFO ] Invariant cache hit.
[2023-03-08 19:53:48] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-08 19:53:48] [INFO ] Invariant cache hit.
[2023-03-08 19:53:48] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 393/393 places, 333/333 transitions.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 16614 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(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
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 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 228 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 60 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:53:48] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 19:53:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 19:53:48] [INFO ] Invariant cache hit.
[2023-03-08 19:53:48] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-08 19:53:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 19:53:48] [INFO ] Invariant cache hit.
[2023-03-08 19:53:49] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 635 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s202 1) (EQ s204 1) (EQ s206 1) (EQ s208 1) (EQ s210 1) (EQ s212 1) (EQ s214 1) (EQ s216 1)), p0:(OR (EQ s202 0) (EQ s204 0) (EQ s206 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33207 reset in 347 ms.
Product exploration explored 100000 steps with 33386 reset in 397 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 518 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:53:50] [INFO ] Invariant cache hit.
[2023-03-08 19:53:50] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:53:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:53:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-08 19:53:50] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 13 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 19:53:51] [INFO ] Invariant cache hit.
[2023-03-08 19:53:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 19:53:51] [INFO ] Invariant cache hit.
[2023-03-08 19:53:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-08 19:53:51] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:53:51] [INFO ] Invariant cache hit.
[2023-03-08 19:53:51] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 630 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33336 reset in 289 ms.
Product exploration explored 100000 steps with 33391 reset in 297 ms.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 19:53:52] [INFO ] Invariant cache hit.
[2023-03-08 19:53:53] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 19:53:53] [INFO ] Invariant cache hit.
[2023-03-08 19:53:53] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-08 19:53:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:53:53] [INFO ] Invariant cache hit.
[2023-03-08 19:53:53] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 618 ms. Remains : 279/279 places, 227/227 transitions.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 5153 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)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 382 transition count 320
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 47 place count 372 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 368 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 368 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 367 transition count 314
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 364 transition count 311
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 68 place count 364 transition count 307
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 70 place count 363 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 70 place count 363 transition count 304
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 74 place count 361 transition count 304
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 228 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 62 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:53:53] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 19:53:53] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 19:53:53] [INFO ] Invariant cache hit.
[2023-03-08 19:53:54] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-08 19:53:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:53:54] [INFO ] Invariant cache hit.
[2023-03-08 19:53:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s258 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5871 steps with 530 reset in 19 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 822 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((F(p0)&&G(p1))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 23 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:53:54] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 19:53:54] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 19:53:54] [INFO ] Invariant cache hit.
[2023-03-08 19:53:55] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-08 19:53:55] [INFO ] Invariant cache hit.
[2023-03-08 19:53:55] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s387 0), p0:(OR (EQ s60 0) (EQ s385 0))], 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]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-08 finished in 963 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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 381 transition count 320
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 372 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 369 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 369 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 55 place count 369 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 366 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 366 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 366 transition count 309
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 66 place count 364 transition count 309
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 5 with 152 rules applied. Total rules applied 218 place count 288 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 288 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 286 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 283 transition count 235
Applied a total of 226 rules in 58 ms. Remains 283 /402 variables (removed 119) and now considering 235/347 (removed 112) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 19:53:55] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:53:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 19:53:55] [INFO ] Invariant cache hit.
[2023-03-08 19:53:55] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-08 19:53:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:53:55] [INFO ] Invariant cache hit.
[2023-03-08 19:53:56] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/402 places, 235/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 651 ms. Remains : 283/402 places, 235/347 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s164 1) (AND (EQ s84 1) (EQ s192 1))), p2:(AND (EQ s84 1) (EQ s192 1)), p1:(AND (EQ s200 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4691 reset in 262 ms.
Product exploration explored 100000 steps with 4670 reset in 261 ms.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 383 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p2]
Incomplete random walk after 10000 steps, including 473 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456383 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456383 steps, saw 185440 distinct states, run finished after 3002 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:54:00] [INFO ] Invariant cache hit.
[2023-03-08 19:54:00] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:54:00] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 19:54:00] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:54:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 19:54:00] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:00] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 19:54:00] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 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 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
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 282 transition count 233
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 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
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 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 24 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 493 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1524238 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1524238 steps, saw 206351 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 19:54:03] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-08 19:54:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:54:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2023-03-08 19:54:04] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:04] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 19:54:04] [INFO ] After 335ms 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 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 19:54:04] [INFO ] Invariant cache hit.
[2023-03-08 19:54:04] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 19:54:04] [INFO ] Invariant cache hit.
[2023-03-08 19:54:04] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-08 19:54:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:04] [INFO ] Invariant cache hit.
[2023-03-08 19:54:04] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 19:54:04] [INFO ] Invariant cache hit.
[2023-03-08 19:54:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 19:54:04] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 67 ms returned sat
[2023-03-08 19:54:05] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:05] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 19:54:05] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 397 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 43 ms :[p2]
Stuttering acceptance computed with spot in 39 ms :[p2]
Support contains 2 out of 283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 19:54:05] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 19:54:05] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 19:54:05] [INFO ] Invariant cache hit.
[2023-03-08 19:54:06] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-08 19:54:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:06] [INFO ] Invariant cache hit.
[2023-03-08 19:54:06] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 283/283 places, 235/235 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 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 26 ms :[p2]
Incomplete random walk after 10000 steps, including 473 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 78 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456688 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456688 steps, saw 185477 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:54:09] [INFO ] Invariant cache hit.
[2023-03-08 19:54:09] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:09] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 19:54:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 19:54:10] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:10] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 19:54:10] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 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 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
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 282 transition count 233
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 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
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 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 23 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1460517 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :{}
Probabilistic random walk after 1460517 steps, saw 197930 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 19:54:13] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 19:54:13] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:13] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 19:54:13] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:54:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-08 19:54:13] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:13] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 19:54:13] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 19:54:13] [INFO ] Invariant cache hit.
[2023-03-08 19:54:13] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 19:54:13] [INFO ] Invariant cache hit.
[2023-03-08 19:54:14] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-08 19:54:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:14] [INFO ] Invariant cache hit.
[2023-03-08 19:54:14] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 19:54:14] [INFO ] Invariant cache hit.
[2023-03-08 19:54:14] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:54:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:54:14] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:14] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 66 ms returned sat
[2023-03-08 19:54:14] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:14] [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 30 ms.
[2023-03-08 19:54:14] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 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 44 ms :[p2]
Stuttering acceptance computed with spot in 30 ms :[p2]
Stuttering acceptance computed with spot in 24 ms :[p2]
Product exploration explored 100000 steps with 4737 reset in 222 ms.
Product exploration explored 100000 steps with 4694 reset in 254 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 283 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 281 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 280 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 280 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 280 transition count 228
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 12 place count 279 transition count 227
Applied a total of 12 rules in 19 ms. Remains 279 /283 variables (removed 4) and now considering 227/235 (removed 8) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:54:15] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 19:54:15] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 19:54:15] [INFO ] Invariant cache hit.
[2023-03-08 19:54:15] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-08 19:54:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:15] [INFO ] Invariant cache hit.
[2023-03-08 19:54:16] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/283 places, 227/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 600 ms. Remains : 279/283 places, 227/235 transitions.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 20787 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((X(X(F(p1)))||p0))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 382 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 364 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 364 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 363 transition count 308
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 68 place count 363 transition count 306
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 72 place count 361 transition count 306
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 222 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 226 place count 284 transition count 236
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 281 transition count 230
Applied a total of 233 rules in 47 ms. Remains 281 /402 variables (removed 121) and now considering 230/347 (removed 117) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 19:54:16] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:54:16] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 19:54:16] [INFO ] Invariant cache hit.
[2023-03-08 19:54:16] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-08 19:54:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:54:16] [INFO ] Invariant cache hit.
[2023-03-08 19:54:16] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/402 places, 230/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 281/402 places, 230/347 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s276 0)), p1:(OR (EQ s166 0) (EQ s190 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4550 reset in 218 ms.
Product exploration explored 100000 steps with 4609 reset in 232 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 469 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:54:17] [INFO ] Invariant cache hit.
[2023-03-08 19:54:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 19:54:17] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:17] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 19:54:17] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 17 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1625359 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :{}
Probabilistic random walk after 1625359 steps, saw 209112 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:54:21] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 19:54:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-08 19:54:21] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:21] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-08 19:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 19:54:21] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 19:54:21] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 19:54:21] [INFO ] Invariant cache hit.
[2023-03-08 19:54:21] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 19:54:21] [INFO ] Invariant cache hit.
[2023-03-08 19:54:21] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-08 19:54:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:21] [INFO ] Invariant cache hit.
[2023-03-08 19:54:22] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:54:22] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 19:54:22] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:22] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-08 19:54:22] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:22] [INFO ] After 233ms 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 19:54:22] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 19:54:22] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 19:54:23] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 19:54:23] [INFO ] Invariant cache hit.
[2023-03-08 19:54:23] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-08 19:54:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:23] [INFO ] Invariant cache hit.
[2023-03-08 19:54:23] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 464 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:54:23] [INFO ] Invariant cache hit.
[2023-03-08 19:54:23] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 19:54:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 19:54:24] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:24] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 19:54:24] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 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 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 20 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 459 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1614987 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{}
Probabilistic random walk after 1614987 steps, saw 207880 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:54:27] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 19:54:27] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:54:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2023-03-08 19:54:27] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:27] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-08 19:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 19:54:27] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 19:54:27] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 19:54:27] [INFO ] Invariant cache hit.
[2023-03-08 19:54:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 19:54:27] [INFO ] Invariant cache hit.
[2023-03-08 19:54:28] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-08 19:54:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:28] [INFO ] Invariant cache hit.
[2023-03-08 19:54:28] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 603 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 19:54:28] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 19:54:28] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:54:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:54:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2023-03-08 19:54:28] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:54:28] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 19:54:28] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4585 reset in 232 ms.
Product exploration explored 100000 steps with 4722 reset in 247 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 19:54:29] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 19:54:29] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 19:54:29] [INFO ] Invariant cache hit.
[2023-03-08 19:54:30] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-08 19:54:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:30] [INFO ] Invariant cache hit.
[2023-03-08 19:54:30] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 281/281 places, 230/230 transitions.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 14222 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 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 382 transition count 319
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 230 place count 283 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 234 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 278 transition count 226
Applied a total of 237 rules in 58 ms. Remains 278 /402 variables (removed 124) and now considering 226/347 (removed 121) transitions.
// Phase 1: matrix 226 rows 278 cols
[2023-03-08 19:54:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:54:30] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 19:54:30] [INFO ] Invariant cache hit.
[2023-03-08 19:54:30] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-08 19:54:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:54:30] [INFO ] Invariant cache hit.
[2023-03-08 19:54:30] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/402 places, 226/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 ms. Remains : 278/402 places, 226/347 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s176 0)], 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 5457 reset in 206 ms.
Product exploration explored 100000 steps with 5511 reset in 225 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 35 ms :[(NOT p0)]
Finished random walk after 143 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-08 19:54:31] [INFO ] Invariant cache hit.
[2023-03-08 19:54:31] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 19:54:31] [INFO ] Invariant cache hit.
[2023-03-08 19:54:32] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-08 19:54:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:32] [INFO ] Invariant cache hit.
[2023-03-08 19:54:32] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 278/278 places, 226/226 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 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 26 ms :[(NOT p0)]
Finished random walk after 2011 steps, including 112 resets, run visited all 1 properties in 7 ms. (steps per millisecond=287 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5369 reset in 197 ms.
Stack based approach found an accepted trace after 77844 steps with 4297 reset with depth 65 and stack size 65 in 174 ms.
FORMULA DES-PT-40b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DES-PT-40b-LTLFireability-11 finished in 2900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 22 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 19:54:33] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 19:54:33] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-08 19:54:33] [INFO ] Invariant cache hit.
[2023-03-08 19:54:33] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-08 19:54:33] [INFO ] Invariant cache hit.
[2023-03-08 19:54:34] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s163 1) (NEQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Product exploration explored 100000 steps with 33333 reset in 223 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-13 finished in 1469 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)) U p1))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 381 transition count 318
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 364 transition count 311
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 67 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 363 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 363 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 362 transition count 306
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 6 with 150 rules applied. Total rules applied 221 place count 287 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 285 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 283 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 282 transition count 231
Applied a total of 228 rules in 43 ms. Remains 282 /402 variables (removed 120) and now considering 231/347 (removed 116) transitions.
// Phase 1: matrix 231 rows 282 cols
[2023-03-08 19:54:34] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 19:54:34] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 19:54:34] [INFO ] Invariant cache hit.
[2023-03-08 19:54:35] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-08 19:54:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:54:35] [INFO ] Invariant cache hit.
[2023-03-08 19:54:35] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/402 places, 231/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 282/402 places, 231/347 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s171 1), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 767 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) U G(p1))||F(p0)))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
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 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
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 6 with 150 rules applied. Total rules applied 226 place count 285 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 283 transition count 230
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 281 transition count 228
Applied a total of 232 rules in 48 ms. Remains 281 /402 variables (removed 121) and now considering 228/347 (removed 119) transitions.
// Phase 1: matrix 228 rows 281 cols
[2023-03-08 19:54:35] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 19:54:35] [INFO ] Implicit Places using invariants in 157 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/402 places, 228/347 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 280/402 places, 228/347 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s20 1) (EQ s193 1)), p1:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-15 finished in 299 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 ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!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' '!(G((F(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
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((X(X(F(p1)))||p0))))'
[2023-03-08 19:54:36] [INFO ] Flatten gal took : 23 ms
[2023-03-08 19:54:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 19:54:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 402 places, 347 transitions and 1193 arcs took 4 ms.
Total runtime 84122 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2004/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2004/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2004/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2004/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-40b-LTLFireability-05
Could not compute solution for formula : DES-PT-40b-LTLFireability-06
Could not compute solution for formula : DES-PT-40b-LTLFireability-09
Could not compute solution for formula : DES-PT-40b-LTLFireability-10

BK_STOP 1678305278267

--------------------
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
mcc2023
ltl formula name DES-PT-40b-LTLFireability-05
ltl formula formula --ltl=/tmp/2004/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 402 places, 347 transitions and 1193 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2004/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2004/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2004/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2004/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-40b-LTLFireability-06
ltl formula formula --ltl=/tmp/2004/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 402 places, 347 transitions and 1193 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2004/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2004/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2004/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2004/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DES-PT-40b-LTLFireability-09
ltl formula formula --ltl=/tmp/2004/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 402 places, 347 transitions and 1193 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2004/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2004/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2004/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2004/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DES-PT-40b-LTLFireability-10
ltl formula formula --ltl=/tmp/2004/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 402 places, 347 transitions and 1193 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2004/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2004/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2004/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2004/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-40b, 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 r105-tall-167814481200468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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