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.r009-oct2-167813598200668.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 865K 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 AutonomousCar-PT-09b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678640601838

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=AutonomousCar-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:03:26] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-12 17:03:26] [INFO ] Transformed 391 places.
[2023-03-12 17:03:26] [INFO ] Transformed 1554 transitions.
[2023-03-12 17:03:26] [INFO ] Found NUPN structural information;
[2023-03-12 17:03:26] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-09b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 335 transition count 1498
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 335 transition count 1498
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 436 place count 335 transition count 1174
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 448 place count 323 transition count 1162
Iterating global reduction 1 with 12 rules applied. Total rules applied 460 place count 323 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 461 place count 322 transition count 1161
Iterating global reduction 1 with 1 rules applied. Total rules applied 462 place count 322 transition count 1161
Applied a total of 462 rules in 125 ms. Remains 322 /391 variables (removed 69) and now considering 1161/1554 (removed 393) transitions.
// Phase 1: matrix 1161 rows 322 cols
[2023-03-12 17:03:26] [INFO ] Computed 14 place invariants in 22 ms
[2023-03-12 17:03:27] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-12 17:03:27] [INFO ] Invariant cache hit.
[2023-03-12 17:03:28] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2023-03-12 17:03:28] [INFO ] Invariant cache hit.
[2023-03-12 17:03:30] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 322/391 places, 1161/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3488 ms. Remains : 322/391 places, 1161/1554 transitions.
Support contains 44 out of 322 places after structural reductions.
[2023-03-12 17:03:30] [INFO ] Flatten gal took : 245 ms
[2023-03-12 17:03:31] [INFO ] Flatten gal took : 171 ms
[2023-03-12 17:03:31] [INFO ] Input system was already deterministic with 1161 transitions.
Support contains 43 out of 322 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 31) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-12 17:03:32] [INFO ] Invariant cache hit.
[2023-03-12 17:03:33] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-12 17:03:35] [INFO ] After 2326ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-12 17:03:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-12 17:03:39] [INFO ] After 3245ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2023-03-12 17:03:41] [INFO ] Deduced a trap composed of 31 places in 838 ms of which 19 ms to minimize.
[2023-03-12 17:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 948 ms
[2023-03-12 17:03:44] [INFO ] After 8239ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 3029 ms.
[2023-03-12 17:03:47] [INFO ] After 11933ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 438 ms.
Support contains 36 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 256 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 18 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1581 edges and 320 vertex of which 318 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 318 transition count 1044
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 162 rules applied. Total rules applied 277 place count 207 transition count 993
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 307 place count 177 transition count 993
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 307 place count 177 transition count 987
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 319 place count 171 transition count 987
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 170 transition count 986
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 170 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 433 place count 114 transition count 930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 114 transition count 929
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 443 place count 105 transition count 856
Iterating global reduction 4 with 9 rules applied. Total rules applied 452 place count 105 transition count 856
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 460 place count 105 transition count 848
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 5 with 4 rules applied. Total rules applied 464 place count 103 transition count 846
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 483 place count 103 transition count 827
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 502 place count 84 transition count 827
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 508 place count 84 transition count 827
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 509 place count 83 transition count 826
Applied a total of 509 rules in 336 ms. Remains 83 /322 variables (removed 239) and now considering 826/1161 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 83/322 places, 826/1161 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 25) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 826 rows 83 cols
[2023-03-12 17:03:48] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-12 17:03:49] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:03:50] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 17:03:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:03:52] [INFO ] After 1919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 17:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:03:54] [INFO ] After 1890ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-12 17:03:56] [INFO ] After 3785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1241 ms.
[2023-03-12 17:03:57] [INFO ] After 7367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 152 ms.
Support contains 26 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 826/826 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 825
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 81 transition count 824
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 81 transition count 824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 80 transition count 823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 80 transition count 822
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 80 transition count 820
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 20 place count 78 transition count 811
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 78 transition count 811
Applied a total of 21 rules in 223 ms. Remains 78 /83 variables (removed 5) and now considering 811/826 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 78/83 places, 811/826 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 811 rows 78 cols
[2023-03-12 17:03:58] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 17:03:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:03:59] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:03:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:04:00] [INFO ] After 886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 17:04:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:00] [INFO ] After 629ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 17:04:01] [INFO ] After 1282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 647 ms.
[2023-03-12 17:04:01] [INFO ] After 2912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 73 ms.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 811/811 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 75 transition count 808
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 73 transition count 806
Applied a total of 10 rules in 47 ms. Remains 73 /78 variables (removed 5) and now considering 806/811 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 73/78 places, 806/811 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 806 rows 73 cols
[2023-03-12 17:04:02] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 17:04:02] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-12 17:04:02] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:04:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-12 17:04:03] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:04] [INFO ] After 462ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:04] [INFO ] After 1012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-03-12 17:04:05] [INFO ] After 2343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 40 ms.
Support contains 17 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 806/806 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 803
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 8 place count 69 transition count 802
Applied a total of 8 rules in 59 ms. Remains 69 /73 variables (removed 4) and now considering 802/806 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 69/73 places, 802/806 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 326471 steps, run timeout after 3004 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326471 steps, saw 50229 distinct states, run finished after 3007 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 802 rows 69 cols
[2023-03-12 17:04:08] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-12 17:04:08] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 17:04:08] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:04:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:09] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:10] [INFO ] After 668ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:10] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 601 ms.
[2023-03-12 17:04:11] [INFO ] After 2649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 12 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 802/802 transitions.
Applied a total of 0 rules in 28 ms. Remains 69 /69 variables (removed 0) and now considering 802/802 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 69/69 places, 802/802 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 802/802 transitions.
Applied a total of 0 rules in 28 ms. Remains 69 /69 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-12 17:04:11] [INFO ] Invariant cache hit.
[2023-03-12 17:04:11] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-12 17:04:11] [INFO ] Invariant cache hit.
[2023-03-12 17:04:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:12] [INFO ] Implicit Places using invariants and state equation in 612 ms returned [63, 67]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 850 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 801/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 800
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 800
Applied a total of 3 rules in 97 ms. Remains 66 /67 variables (removed 1) and now considering 800/801 (removed 1) transitions.
// Phase 1: matrix 800 rows 66 cols
[2023-03-12 17:04:12] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 17:04:12] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 17:04:12] [INFO ] Invariant cache hit.
[2023-03-12 17:04:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:13] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/69 places, 800/802 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1710 ms. Remains : 66/69 places, 800/802 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 457409 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457409 steps, saw 67286 distinct states, run finished after 3005 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:04:16] [INFO ] Invariant cache hit.
[2023-03-12 17:04:16] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 17:04:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:04:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:17] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:18] [INFO ] After 410ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:18] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-03-12 17:04:19] [INFO ] After 2092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 800/800 transitions.
Applied a total of 0 rules in 28 ms. Remains 66 /66 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 66/66 places, 800/800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 800/800 transitions.
Applied a total of 0 rules in 26 ms. Remains 66 /66 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-12 17:04:19] [INFO ] Invariant cache hit.
[2023-03-12 17:04:19] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 17:04:19] [INFO ] Invariant cache hit.
[2023-03-12 17:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:20] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-12 17:04:20] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-12 17:04:20] [INFO ] Invariant cache hit.
[2023-03-12 17:04:20] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 66/66 places, 800/800 transitions.
Applied a total of 0 rules in 31 ms. Remains 66 /66 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-12 17:04:20] [INFO ] Invariant cache hit.
[2023-03-12 17:04:20] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:20] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:04:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:21] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:04:22] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-12 17:04:22] [INFO ] After 1797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-09b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 48 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 285 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 315 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 4 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 464 place count 98 transition count 915
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 465 place count 98 transition count 914
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 479 place count 84 transition count 792
Iterating global reduction 5 with 14 rules applied. Total rules applied 493 place count 84 transition count 792
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 502 place count 84 transition count 783
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 506 place count 82 transition count 781
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 508 place count 80 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 509 place count 79 transition count 779
Applied a total of 509 rules in 251 ms. Remains 79 /322 variables (removed 243) and now considering 779/1161 (removed 382) transitions.
// Phase 1: matrix 779 rows 79 cols
[2023-03-12 17:04:23] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-12 17:04:24] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 17:04:24] [INFO ] Invariant cache hit.
[2023-03-12 17:04:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:04:24] [INFO ] Implicit Places using invariants and state equation in 743 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1072 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/322 places, 779/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 778
Applied a total of 2 rules in 92 ms. Remains 76 /77 variables (removed 1) and now considering 778/779 (removed 1) transitions.
// Phase 1: matrix 778 rows 76 cols
[2023-03-12 17:04:24] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-12 17:04:25] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 17:04:25] [INFO ] Invariant cache hit.
[2023-03-12 17:04:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:25] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/322 places, 778/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2296 ms. Remains : 76/322 places, 778/1161 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s15 1), p1:(OR (EQ s13 0) (EQ s20 0) (EQ s29 0) (EQ s33 0) (EQ s42 0) (EQ s46 0) (EQ s55 0) (EQ s61 0) (EQ s65 0) (EQ s72 0))], 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]]
Product exploration explored 100000 steps with 12630 reset in 765 ms.
Product exploration explored 100000 steps with 12629 reset in 717 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 583 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 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Finished Best-First random walk after 1088 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=544 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 658 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 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 778/778 transitions.
Applied a total of 0 rules in 69 ms. Remains 76 /76 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2023-03-12 17:04:29] [INFO ] Invariant cache hit.
[2023-03-12 17:04:29] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-12 17:04:29] [INFO ] Invariant cache hit.
[2023-03-12 17:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:30] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-12 17:04:30] [INFO ] Redundant transitions in 175 ms returned [568]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 777 rows 76 cols
[2023-03-12 17:04:30] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-12 17:04:31] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 777/778 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 74 transition count 775
Applied a total of 2 rules in 54 ms. Remains 74 /76 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 74 cols
[2023-03-12 17:04:31] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-12 17:04:32] [INFO ] Implicit Places using invariants in 981 ms returned []
[2023-03-12 17:04:32] [INFO ] Invariant cache hit.
[2023-03-12 17:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:33] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/76 places, 775/778 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4326 ms. Remains : 74/76 places, 775/778 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 500 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 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :2
Finished Best-First random walk after 2955 steps, including 10 resets, run visited all 1 properties in 5 ms. (steps per millisecond=591 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 616 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 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14285 reset in 835 ms.
Product exploration explored 100000 steps with 14285 reset in 875 ms.
Support contains 11 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 775/775 transitions.
Applied a total of 0 rules in 30 ms. Remains 74 /74 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2023-03-12 17:04:37] [INFO ] Invariant cache hit.
[2023-03-12 17:04:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 17:04:37] [INFO ] Invariant cache hit.
[2023-03-12 17:04:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:38] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-12 17:04:38] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 17:04:38] [INFO ] Invariant cache hit.
[2023-03-12 17:04:38] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1435 ms. Remains : 74/74 places, 775/775 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-01 finished in 15928 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(G(p0)))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 18 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-12 17:04:39] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-12 17:04:39] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-12 17:04:39] [INFO ] Invariant cache hit.
[2023-03-12 17:04:40] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2023-03-12 17:04:40] [INFO ] Invariant cache hit.
[2023-03-12 17:04:41] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2149 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s4 1) (NEQ s18 1) (NEQ s260 1) (NEQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 424 reset in 321 ms.
Entered a terminal (fully accepting) state of product in 43769 steps with 360 reset in 166 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-02 finished in 2911 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||G(p1))) U p1))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 282 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 165 rules applied. Total rules applied 281 place count 204 transition count 993
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 312 place count 174 transition count 992
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 315 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 5 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 462 place count 99 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 463 place count 99 transition count 915
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 474 place count 88 transition count 823
Iterating global reduction 6 with 11 rules applied. Total rules applied 485 place count 88 transition count 823
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 494 place count 88 transition count 814
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 7 with 4 rules applied. Total rules applied 498 place count 86 transition count 812
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 500 place count 84 transition count 810
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 501 place count 83 transition count 810
Applied a total of 501 rules in 207 ms. Remains 83 /322 variables (removed 239) and now considering 810/1161 (removed 351) transitions.
// Phase 1: matrix 810 rows 83 cols
[2023-03-12 17:04:42] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-12 17:04:42] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-12 17:04:42] [INFO ] Invariant cache hit.
[2023-03-12 17:04:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:04:43] [INFO ] Implicit Places using invariants and state equation in 615 ms returned [78, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 783 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/322 places, 810/1161 transitions.
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 2 place count 80 transition count 809
Applied a total of 2 rules in 50 ms. Remains 80 /81 variables (removed 1) and now considering 809/810 (removed 1) transitions.
// Phase 1: matrix 809 rows 80 cols
[2023-03-12 17:04:43] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-12 17:04:43] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-12 17:04:43] [INFO ] Invariant cache hit.
[2023-03-12 17:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:44] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/322 places, 809/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2425 ms. Remains : 80/322 places, 809/1161 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s20 1) (EQ s28 1) (EQ s35 1) (EQ s42 1) (EQ s49 1) (EQ s56 1) (EQ s63 1) (EQ s72 1) (EQ s76 1)), p0:(NEQ s25 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 34 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-03 finished in 2619 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(G(p0))&&F((G(F(p2))&&p1)))))'
Support contains 19 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 22 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-12 17:04:44] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 17:04:45] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-12 17:04:45] [INFO ] Invariant cache hit.
[2023-03-12 17:04:45] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-12 17:04:45] [INFO ] Invariant cache hit.
[2023-03-12 17:04:46] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1551 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s64 1) (EQ s84 1) (EQ s114 1) (EQ s134 1) (EQ s159 1) (EQ s189 1) (EQ s209 1) (EQ s239 1) (EQ s259 1) (EQ s286 1)), p1:(AND (EQ s4 1) (EQ s15 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-04 finished in 1972 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(X(G((p0||G(p1))))))))'
Support contains 14 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 25 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
[2023-03-12 17:04:46] [INFO ] Invariant cache hit.
[2023-03-12 17:04:47] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-12 17:04:47] [INFO ] Invariant cache hit.
[2023-03-12 17:04:48] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2023-03-12 17:04:48] [INFO ] Invariant cache hit.
[2023-03-12 17:04:48] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1958 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 430 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (EQ s59 1) (EQ s84 1) (EQ s109 1) (EQ s139 1) (EQ s159 1) (EQ s184 1) (EQ s214 1) (EQ s234 1) (EQ s259 1) (EQ s286 1)), p0:(AND (EQ s4 1) (EQ s14 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-05 finished in 2422 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(p1) U X(p2))||p0))))'
Support contains 14 out of 322 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 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 273 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 319 transition count 1043
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 314 place count 173 transition count 991
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 314 place count 173 transition count 986
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 324 place count 168 transition count 986
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 327 place count 165 transition count 983
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 165 transition count 983
Performed 60 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 450 place count 105 transition count 922
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 451 place count 105 transition count 921
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 462 place count 94 transition count 829
Iterating global reduction 4 with 11 rules applied. Total rules applied 473 place count 94 transition count 829
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 482 place count 94 transition count 820
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 5 with 4 rules applied. Total rules applied 486 place count 92 transition count 818
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 488 place count 90 transition count 816
Applied a total of 488 rules in 142 ms. Remains 90 /322 variables (removed 232) and now considering 816/1161 (removed 345) transitions.
// Phase 1: matrix 816 rows 90 cols
[2023-03-12 17:04:49] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-12 17:04:49] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 17:04:49] [INFO ] Invariant cache hit.
[2023-03-12 17:04:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:04:50] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 617 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/322 places, 816/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 815
Applied a total of 2 rules in 58 ms. Remains 87 /88 variables (removed 1) and now considering 815/816 (removed 1) transitions.
// Phase 1: matrix 815 rows 87 cols
[2023-03-12 17:04:50] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 17:04:50] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 17:04:50] [INFO ] Invariant cache hit.
[2023-03-12 17:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:50] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/322 places, 815/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1439 ms. Remains : 87/322 places, 815/1161 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s53 0) (EQ s82 0)), p2:(AND (EQ s15 1) (EQ s24 1) (EQ s32 1) (EQ s37 1) (EQ s44 1) (EQ s56 1) (EQ s64 1) (EQ s69 1) (EQ s76...], 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 351 reset in 181 ms.
Product exploration explored 100000 steps with 48 reset in 119 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 192 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 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 632569 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632569 steps, saw 100226 distinct states, run finished after 3004 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:04:54] [INFO ] Invariant cache hit.
[2023-03-12 17:04:54] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:04:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:04:55] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:55] [INFO ] After 188ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:04:56] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-12 17:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-12 17:04:56] [INFO ] After 851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-12 17:04:56] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 14 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 815/815 transitions.
Graph (complete) has 973 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 812
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 83 transition count 809
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 81 transition count 789
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 81 transition count 789
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 1 with 4 rules applied. Total rules applied 17 place count 79 transition count 787
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 79 transition count 772
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 47 place count 64 transition count 772
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 773
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 63 transition count 773
Applied a total of 54 rules in 161 ms. Remains 63 /87 variables (removed 24) and now considering 773/815 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 63/87 places, 773/815 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 567514 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567514 steps, saw 86076 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 773 rows 63 cols
[2023-03-12 17:04:59] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 17:05:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:05:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 17:05:00] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:05:00] [INFO ] After 211ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:01] [INFO ] Deduced a trap composed of 6 places in 508 ms of which 1 ms to minimize.
[2023-03-12 17:05:01] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 0 ms to minimize.
[2023-03-12 17:05:02] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 0 ms to minimize.
[2023-03-12 17:05:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1366 ms
[2023-03-12 17:05:02] [INFO ] After 1815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-12 17:05:02] [INFO ] After 2635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 50 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 63/63 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 33 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-12 17:05:02] [INFO ] Invariant cache hit.
[2023-03-12 17:05:03] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 17:05:03] [INFO ] Invariant cache hit.
[2023-03-12 17:05:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:05:03] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-12 17:05:03] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-12 17:05:03] [INFO ] Invariant cache hit.
[2023-03-12 17:05:04] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1298 ms. Remains : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 24 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 17:05:04] [INFO ] Invariant cache hit.
[2023-03-12 17:05:04] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:05:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:05:04] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:05] [INFO ] Deduced a trap composed of 6 places in 595 ms of which 1 ms to minimize.
[2023-03-12 17:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 649 ms
[2023-03-12 17:05:05] [INFO ] After 1481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-12 17:05:05] [INFO ] After 1763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 249 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 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 14 out of 87 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 : 87/87 places, 815/815 transitions.
Applied a total of 0 rules in 64 ms. Remains 87 /87 variables (removed 0) and now considering 815/815 (removed 0) transitions.
// Phase 1: matrix 815 rows 87 cols
[2023-03-12 17:05:06] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 17:05:06] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 17:05:06] [INFO ] Invariant cache hit.
[2023-03-12 17:05:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:07] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-12 17:05:07] [INFO ] Redundant transitions in 33 ms returned [578]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 814 rows 87 cols
[2023-03-12 17:05:07] [INFO ] Computed 11 place invariants in 20 ms
[2023-03-12 17:05:07] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 814/815 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 812
Applied a total of 2 rules in 36 ms. Remains 85 /87 variables (removed 2) and now considering 812/814 (removed 2) transitions.
// Phase 1: matrix 812 rows 85 cols
[2023-03-12 17:05:07] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 17:05:07] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-12 17:05:07] [INFO ] Invariant cache hit.
[2023-03-12 17:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:08] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/87 places, 812/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2198 ms. Remains : 85/87 places, 812/815 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 190 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 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 550784 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550784 steps, saw 91966 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:05:12] [INFO ] Invariant cache hit.
[2023-03-12 17:05:12] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:05:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 17:05:13] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:13] [INFO ] After 263ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:14] [INFO ] Deduced a trap composed of 7 places in 437 ms of which 1 ms to minimize.
[2023-03-12 17:05:14] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-12 17:05:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2023-03-12 17:05:14] [INFO ] After 1371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-12 17:05:14] [INFO ] After 2361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 812/812 transitions.
Graph (complete) has 966 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 810
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 81 transition count 807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 79 transition count 787
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 79 transition count 787
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 1 with 4 rules applied. Total rules applied 16 place count 77 transition count 785
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 77 transition count 770
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 62 transition count 770
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 62 transition count 770
Applied a total of 51 rules in 136 ms. Remains 62 /85 variables (removed 23) and now considering 770/812 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 62/85 places, 770/812 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 661514 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661514 steps, saw 96471 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 770 rows 62 cols
[2023-03-12 17:05:18] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 17:05:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:05:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:05:18] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:19] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-12 17:05:19] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 770/770 transitions.
Applied a total of 0 rules in 38 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 62/62 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 770/770 transitions.
Applied a total of 0 rules in 31 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2023-03-12 17:05:19] [INFO ] Invariant cache hit.
[2023-03-12 17:05:19] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 17:05:19] [INFO ] Invariant cache hit.
[2023-03-12 17:05:20] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-12 17:05:20] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 17:05:20] [INFO ] Invariant cache hit.
[2023-03-12 17:05:20] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 62/62 places, 770/770 transitions.
Applied a total of 0 rules in 28 ms. Remains 62 /62 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 17:05:20] [INFO ] Invariant cache hit.
[2023-03-12 17:05:20] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:05:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 17:05:21] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:05:22] [INFO ] Deduced a trap composed of 7 places in 483 ms of which 0 ms to minimize.
[2023-03-12 17:05:22] [INFO ] Deduced a trap composed of 6 places in 700 ms of which 13 ms to minimize.
[2023-03-12 17:05:23] [INFO ] Deduced a trap composed of 6 places in 573 ms of which 1 ms to minimize.
[2023-03-12 17:05:23] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 0 ms to minimize.
[2023-03-12 17:05:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2296 ms
[2023-03-12 17:05:24] [INFO ] After 3276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-12 17:05:24] [INFO ] After 3585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 214 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 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 88 reset in 78 ms.
Product exploration explored 100000 steps with 509 reset in 136 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 812/812 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 789
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 789
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 0 with 4 rules applied. Total rules applied 14 place count 78 transition count 787
Applied a total of 14 rules in 55 ms. Remains 78 /85 variables (removed 7) and now considering 787/812 (removed 25) transitions.
// Phase 1: matrix 787 rows 78 cols
[2023-03-12 17:05:25] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 17:05:25] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-12 17:05:25] [INFO ] Invariant cache hit.
[2023-03-12 17:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:26] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2023-03-12 17:05:26] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 17:05:26] [INFO ] Invariant cache hit.
[2023-03-12 17:05:28] [INFO ] Dead Transitions using invariants and state equation in 2341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/85 places, 787/812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3776 ms. Remains : 78/85 places, 787/812 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-06 finished in 39881 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((X(X(p0)) U (G(!p2)&&p1)))))'
Support contains 14 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 25 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-12 17:05:29] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 17:05:29] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 17:05:29] [INFO ] Invariant cache hit.
[2023-03-12 17:05:30] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-12 17:05:30] [INFO ] Invariant cache hit.
[2023-03-12 17:05:30] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), p2, (NOT p0), true, (AND p2 (NOT p0)), p2]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=p2, acceptance={} source=8 dest: 6}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s84 1) (EQ s109 1) (EQ s139 1) (EQ s159 1) (EQ s189 1) (EQ s214 1) (EQ s239 1) (EQ s259 1) (EQ s286 1)), p2:(AND (EQ s4 1) (EQ s14 ...], 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 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 2095 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(X(!(!p0 U !(X(!p1) U p0)))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 11 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
[2023-03-12 17:05:31] [INFO ] Invariant cache hit.
[2023-03-12 17:05:31] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 17:05:31] [INFO ] Invariant cache hit.
[2023-03-12 17:05:32] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2023-03-12 17:05:32] [INFO ] Invariant cache hit.
[2023-03-12 17:05:33] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1953 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s13 1) (EQ s110 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-09 finished in 2064 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&&F(p1)&&F(p2)))))'
Support contains 7 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 12 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-12 17:05:33] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-12 17:05:34] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-12 17:05:34] [INFO ] Invariant cache hit.
[2023-03-12 17:05:34] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2023-03-12 17:05:34] [INFO ] Invariant cache hit.
[2023-03-12 17:05:35] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2393 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s235 1), p1:(NEQ s30 1), p2:(OR (NEQ s4 1) (NEQ s14 1) (NEQ s185 1) (NEQ s286 1) (NEQ s317 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-10 finished in 2687 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 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 305 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 319 transition count 1042
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 163 transition count 981
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 163 transition count 981
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 480 place count 90 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 90 transition count 906
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 499 place count 72 transition count 743
Iterating global reduction 4 with 18 rules applied. Total rules applied 517 place count 72 transition count 743
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 525 place count 72 transition count 735
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 5 with 4 rules applied. Total rules applied 529 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 530 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 68 transition count 731
Applied a total of 532 rules in 217 ms. Remains 68 /322 variables (removed 254) and now considering 731/1161 (removed 430) transitions.
// Phase 1: matrix 731 rows 68 cols
[2023-03-12 17:05:36] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-12 17:05:36] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 17:05:36] [INFO ] Invariant cache hit.
[2023-03-12 17:05:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:05:37] [INFO ] Implicit Places using invariants and state equation in 751 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1151 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/322 places, 731/1161 transitions.
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 2 place count 65 transition count 730
Applied a total of 2 rules in 41 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2023-03-12 17:05:37] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 17:05:37] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-12 17:05:37] [INFO ] Invariant cache hit.
[2023-03-12 17:05:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:38] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/322 places, 730/1161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2665 ms. Remains : 65/322 places, 730/1161 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-12 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:(OR (NEQ s1 1) (NEQ s10 1) (NEQ s33 1) (NEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 89 reset in 74 ms.
Product exploration explored 100000 steps with 814 reset in 122 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 513 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1048244 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1048244 steps, saw 157015 distinct states, run finished after 3013 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:05:42] [INFO ] Invariant cache hit.
[2023-03-12 17:05:42] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 17:05:43] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:05:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:05:43] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:05:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:43] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:05:43] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-12 17:05:43] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 168 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 53/65 places, 718/730 transitions.
Finished random walk after 4270 steps, including 42 resets, run visited all 1 properties in 32 ms. (steps per millisecond=133 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 286 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 46 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2023-03-12 17:05:44] [INFO ] Invariant cache hit.
[2023-03-12 17:05:45] [INFO ] Implicit Places using invariants in 701 ms returned []
[2023-03-12 17:05:45] [INFO ] Invariant cache hit.
[2023-03-12 17:05:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:45] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2023-03-12 17:05:46] [INFO ] Redundant transitions in 75 ms returned [555]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 729 rows 65 cols
[2023-03-12 17:05:46] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 17:05:46] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 63 transition count 727
Applied a total of 2 rules in 50 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2023-03-12 17:05:46] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 17:05:47] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 17:05:47] [INFO ] Invariant cache hit.
[2023-03-12 17:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:48] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4033 ms. Remains : 63/65 places, 727/730 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1061143 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1061143 steps, saw 159638 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:05:51] [INFO ] Invariant cache hit.
[2023-03-12 17:05:52] [INFO ] [Real]Absence check using 11 positive place invariants in 113 ms returned sat
[2023-03-12 17:05:53] [INFO ] After 1111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:05:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 17:05:53] [INFO ] After 817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:54] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:05:54] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-12 17:05:54] [INFO ] After 1319ms 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 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 113 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 52/63 places, 715/727 transitions.
Finished random walk after 269 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=134 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1465 reset in 175 ms.
Product exploration explored 100000 steps with 212 reset in 71 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 51 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2023-03-12 17:05:55] [INFO ] Invariant cache hit.
[2023-03-12 17:05:56] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-12 17:05:56] [INFO ] Invariant cache hit.
[2023-03-12 17:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:05:56] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-12 17:05:56] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 17:05:56] [INFO ] Invariant cache hit.
[2023-03-12 17:05:57] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1834 ms. Remains : 63/63 places, 727/727 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-12 finished in 21406 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||X((p0&&G(F(p1))))))))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 9 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-12 17:05:57] [INFO ] Computed 14 place invariants in 17 ms
[2023-03-12 17:05:57] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-12 17:05:57] [INFO ] Invariant cache hit.
[2023-03-12 17:05:58] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2023-03-12 17:05:58] [INFO ] Invariant cache hit.
[2023-03-12 17:05:58] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1607 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s157 0), p1:(OR (EQ s59 0) (EQ s89 0) (EQ s114 0) (EQ s139 0) (EQ s159 0) (EQ s190 0) (EQ s215 0) (EQ s235 0) (EQ s265 0) (EQ s287 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 820 reset in 315 ms.
Product exploration explored 100000 steps with 828 reset in 374 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-12 17:06:00] [INFO ] Invariant cache hit.
[2023-03-12 17:06:01] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:06:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-12 17:06:01] [INFO ] After 99ms 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 p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 527 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2023-03-12 17:06:02] [INFO ] Invariant cache hit.
[2023-03-12 17:06:02] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-12 17:06:02] [INFO ] Invariant cache hit.
[2023-03-12 17:06:03] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2023-03-12 17:06:03] [INFO ] Invariant cache hit.
[2023-03-12 17:06:04] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 320/320 places, 1159/1159 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2613 steps, including 21 resets, run visited all 1 properties in 11 ms. (steps per millisecond=237 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 403 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 282 reset in 245 ms.
Product exploration explored 100000 steps with 185 reset in 222 ms.
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2023-03-12 17:06:06] [INFO ] Invariant cache hit.
[2023-03-12 17:06:06] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-12 17:06:06] [INFO ] Invariant cache hit.
[2023-03-12 17:06:08] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-03-12 17:06:08] [INFO ] Invariant cache hit.
[2023-03-12 17:06:08] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 320/320 places, 1159/1159 transitions.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 11434 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(X(G(p0))))||F(p1))))'
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 320 transition count 1159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 320 transition count 1159
Applied a total of 4 rules in 10 ms. Remains 320 /322 variables (removed 2) and now considering 1159/1161 (removed 2) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2023-03-12 17:06:08] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-12 17:06:09] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 17:06:09] [INFO ] Invariant cache hit.
[2023-03-12 17:06:09] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2023-03-12 17:06:09] [INFO ] Invariant cache hit.
[2023-03-12 17:06:10] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/322 places, 1159/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1721 ms. Remains : 320/322 places, 1159/1161 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(AND (EQ s59 1) (EQ s89 1) (EQ s109 1) (EQ s134 1) (EQ s159 1) (EQ s189 1) (EQ s214 1) (EQ s234 1) (EQ s259 1) (EQ s287 1)), p0:(EQ s272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-14 finished in 2102 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)&&X((F(p3)&&p2)))))'
Support contains 15 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 319 transition count 1158
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 319 transition count 1158
Applied a total of 6 rules in 28 ms. Remains 319 /322 variables (removed 3) and now considering 1158/1161 (removed 3) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2023-03-12 17:06:10] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-12 17:06:11] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-12 17:06:11] [INFO ] Invariant cache hit.
[2023-03-12 17:06:11] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-12 17:06:11] [INFO ] Invariant cache hit.
[2023-03-12 17:06:12] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/322 places, 1158/1161 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1440 ms. Remains : 319/322 places, 1158/1161 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s11 0) (EQ s258 0) (EQ s285 0)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s258 1) (EQ s285 1)), p2:(AND (EQ s59 1) (EQ s89 1) (EQ s114 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-15 finished in 1783 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)||G(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' '!(G(F(((G(p1) U X(p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-13
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 322 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 322/322 places, 1161/1161 transitions.
Graph (trivial) has 286 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 319 transition count 1042
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 984
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 164 transition count 982
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 164 transition count 982
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 462 place count 99 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 99 transition count 915
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 479 place count 83 transition count 773
Iterating global reduction 4 with 16 rules applied. Total rules applied 495 place count 83 transition count 773
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 504 place count 83 transition count 764
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 5 with 4 rules applied. Total rules applied 508 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 79 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 78 transition count 760
Applied a total of 511 rules in 80 ms. Remains 78 /322 variables (removed 244) and now considering 760/1161 (removed 401) transitions.
// Phase 1: matrix 760 rows 78 cols
[2023-03-12 17:06:13] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-12 17:06:13] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 17:06:13] [INFO ] Invariant cache hit.
[2023-03-12 17:06:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:06:14] [INFO ] Implicit Places using invariants and state equation in 467 ms returned [73, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 765 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 76/322 places, 760/1161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 759
Applied a total of 2 rules in 36 ms. Remains 75 /76 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 75 cols
[2023-03-12 17:06:14] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-12 17:06:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-12 17:06:14] [INFO ] Invariant cache hit.
[2023-03-12 17:06:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:06:14] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/322 places, 759/1161 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1601 ms. Remains : 75/322 places, 759/1161 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s36 0), p1:(OR (EQ s13 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s38 0) (EQ s48 0) (EQ s54 0) (EQ s58 0) (EQ s67 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 51 ms.
Product exploration explored 100000 steps with 988 reset in 244 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 355 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:06:16] [INFO ] Invariant cache hit.
[2023-03-12 17:06:16] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:06:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 17:06:16] [INFO ] After 36ms 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 p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 428 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 759/759 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-12 17:06:16] [INFO ] Invariant cache hit.
[2023-03-12 17:06:17] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 17:06:17] [INFO ] Invariant cache hit.
[2023-03-12 17:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:06:17] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-12 17:06:17] [INFO ] Invariant cache hit.
[2023-03-12 17:06:18] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1238 ms. Remains : 75/75 places, 759/759 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6957 steps, including 268 resets, run visited all 1 properties in 69 ms. (steps per millisecond=100 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 4354 steps with 159 reset in 56 ms.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 6241 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-12 17:06:19] [INFO ] Flatten gal took : 119 ms
[2023-03-12 17:06:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 17:06:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 322 places, 1161 transitions and 13513 arcs took 15 ms.
Total runtime 173441 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1956/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-01
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-12
Could not compute solution for formula : AutonomousCar-PT-09b-LTLFireability-13

BK_STOP 1678640782237

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-09b-LTLFireability-01
ltl formula formula --ltl=/tmp/1956/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 322 places, 1161 transitions and 13513 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.410 real 0.150 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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 AutonomousCar-PT-09b-LTLFireability-06
ltl formula formula --ltl=/tmp/1956/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 322 places, 1161 transitions and 13513 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.270 real 0.090 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 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 AutonomousCar-PT-09b-LTLFireability-12
ltl formula formula --ltl=/tmp/1956/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 322 places, 1161 transitions and 13513 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.240 real 0.080 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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 AutonomousCar-PT-09b-LTLFireability-13
ltl formula formula --ltl=/tmp/1956/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 322 places, 1161 transitions and 13513 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.270 real 0.110 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1956/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 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="AutonomousCar-PT-09b"
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 AutonomousCar-PT-09b, 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 r009-oct2-167813598200668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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