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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 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 517K 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-08b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639427931

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-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:43:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:43:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:43:51] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-12 16:43:51] [INFO ] Transformed 357 places.
[2023-03-12 16:43:51] [INFO ] Transformed 1128 transitions.
[2023-03-12 16:43:51] [INFO ] Found NUPN structural information;
[2023-03-12 16:43:51] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-08b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 304 transition count 1075
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 304 transition count 1075
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 362 place count 304 transition count 819
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 373 place count 293 transition count 808
Iterating global reduction 1 with 11 rules applied. Total rules applied 384 place count 293 transition count 808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 385 place count 292 transition count 807
Iterating global reduction 1 with 1 rules applied. Total rules applied 386 place count 292 transition count 807
Applied a total of 386 rules in 100 ms. Remains 292 /357 variables (removed 65) and now considering 807/1128 (removed 321) transitions.
// Phase 1: matrix 807 rows 292 cols
[2023-03-12 16:43:51] [INFO ] Computed 13 place invariants in 30 ms
[2023-03-12 16:43:51] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 16:43:51] [INFO ] Invariant cache hit.
[2023-03-12 16:43:52] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-03-12 16:43:52] [INFO ] Invariant cache hit.
[2023-03-12 16:43:52] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/357 places, 807/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1265 ms. Remains : 292/357 places, 807/1128 transitions.
Support contains 41 out of 292 places after structural reductions.
[2023-03-12 16:43:53] [INFO ] Flatten gal took : 127 ms
[2023-03-12 16:43:53] [INFO ] Flatten gal took : 76 ms
[2023-03-12 16:43:53] [INFO ] Input system was already deterministic with 807 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-12 16:43:53] [INFO ] Invariant cache hit.
[2023-03-12 16:43:54] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:43:55] [INFO ] After 1303ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-12 16:43:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-12 16:43:57] [INFO ] After 1773ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-12 16:43:58] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 10 ms to minimize.
[2023-03-12 16:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-12 16:44:00] [INFO ] After 4226ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 1680 ms.
[2023-03-12 16:44:01] [INFO ] After 6286ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 34 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 234 edges and 292 vertex of which 4 / 292 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1319 edges and 290 vertex of which 288 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 288 transition count 703
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 147 rules applied. Total rules applied 249 place count 190 transition count 654
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 278 place count 161 transition count 654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 278 place count 161 transition count 648
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 290 place count 155 transition count 648
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 390 place count 105 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 105 transition count 597
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 393 place count 103 transition count 588
Iterating global reduction 4 with 2 rules applied. Total rules applied 395 place count 103 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 103 transition count 587
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 5 with 2 rules applied. Total rules applied 398 place count 102 transition count 586
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 421 place count 102 transition count 563
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 444 place count 79 transition count 563
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 449 place count 79 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 78 transition count 562
Applied a total of 450 rules in 211 ms. Remains 78 /292 variables (removed 214) and now considering 562/807 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 78/292 places, 562/807 transitions.
Incomplete random walk after 10000 steps, including 354 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 562 rows 78 cols
[2023-03-12 16:44:02] [INFO ] Computed 13 place invariants in 16 ms
[2023-03-12 16:44:02] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:44:03] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:44:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 40 ms returned sat
[2023-03-12 16:44:03] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:44:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:03] [INFO ] After 152ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:44:03] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-12 16:44:04] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 561
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 77 transition count 561
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 68 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 66 transition count 534
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 66 transition count 534
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 61 transition count 529
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 61 transition count 522
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 104 place count 54 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 53 transition count 465
Applied a total of 105 rules in 155 ms. Remains 53 /78 variables (removed 25) and now considering 465/562 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 53/78 places, 465/562 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1266728 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{0=1}
Probabilistic random walk after 1266728 steps, saw 175653 distinct states, run finished after 3003 ms. (steps per millisecond=421 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 465 rows 53 cols
[2023-03-12 16:44:07] [INFO ] Computed 13 place invariants in 15 ms
[2023-03-12 16:44:07] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:44:07] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:44:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:44:07] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:07] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:08] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 16:44:08] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 465/465 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 456
Applied a total of 2 rules in 23 ms. Remains 52 /53 variables (removed 1) and now considering 456/465 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 52/53 places, 456/465 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1655923 steps, run timeout after 3001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 1655923 steps, saw 222240 distinct states, run finished after 3014 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 456 rows 52 cols
[2023-03-12 16:44:11] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 16:44:11] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-12 16:44:11] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:44:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:44:11] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:11] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:11] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 16:44:11] [INFO ] After 421ms 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 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 456/456 transitions.
Applied a total of 0 rules in 19 ms. Remains 52 /52 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 52/52 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 456/456 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-12 16:44:12] [INFO ] Invariant cache hit.
[2023-03-12 16:44:12] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-12 16:44:12] [INFO ] Invariant cache hit.
[2023-03-12 16:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:12] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [47, 51]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 700 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 455/456 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 49 transition count 454
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 453
Applied a total of 4 rules in 36 ms. Remains 48 /50 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 48 cols
[2023-03-12 16:44:12] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:44:13] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 16:44:13] [INFO ] Invariant cache hit.
[2023-03-12 16:44:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:44:13] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/52 places, 453/456 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1470 ms. Remains : 48/52 places, 453/456 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 528724 steps, run visited all 1 properties in 919 ms. (steps per millisecond=575 )
Probabilistic random walk after 528724 steps, saw 77322 distinct states, run finished after 924 ms. (steps per millisecond=572 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 45 stabilizing places and 46 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' '!(X((X(G(p0))&&F(p1))))'
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 22 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-12 16:44:15] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 16:44:15] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-12 16:44:15] [INFO ] Invariant cache hit.
[2023-03-12 16:44:16] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-12 16:44:16] [INFO ] Invariant cache hit.
[2023-03-12 16:44:16] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1231 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s112 1), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s55 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-00 finished in 1749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X(G(p0))))'
Support contains 9 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 21 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-12 16:44:16] [INFO ] Invariant cache hit.
[2023-03-12 16:44:17] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 16:44:17] [INFO ] Invariant cache hit.
[2023-03-12 16:44:17] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-12 16:44:17] [INFO ] Invariant cache hit.
[2023-03-12 16:44:18] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1399 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s61 1) (EQ s81 1) (EQ s106 1) (EQ s131 1) (EQ s156 1) (EQ s181 1) (EQ s211 1) (EQ s231 1) (EQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-01 finished in 1549 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(((p1 U G((X(!p1)&&p2)))&&p0))))'
Support contains 7 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 272 edges and 292 vertex of which 4 / 292 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 289 transition count 700
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 151 rules applied. Total rules applied 256 place count 185 transition count 653
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 284 place count 157 transition count 653
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 284 place count 157 transition count 647
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 296 place count 151 transition count 647
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 297 place count 150 transition count 646
Iterating global reduction 3 with 1 rules applied. Total rules applied 298 place count 150 transition count 646
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 432 place count 83 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 433 place count 83 transition count 577
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 447 place count 69 transition count 467
Iterating global reduction 4 with 14 rules applied. Total rules applied 461 place count 69 transition count 467
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 469 place count 69 transition count 459
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 473 place count 67 transition count 457
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 475 place count 65 transition count 455
Applied a total of 475 rules in 187 ms. Remains 65 /292 variables (removed 227) and now considering 455/807 (removed 352) transitions.
// Phase 1: matrix 455 rows 65 cols
[2023-03-12 16:44:18] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:44:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 16:44:18] [INFO ] Invariant cache hit.
[2023-03-12 16:44:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:44:19] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 480 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/292 places, 455/807 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 62 transition count 454
Applied a total of 2 rules in 57 ms. Remains 62 /63 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 62 cols
[2023-03-12 16:44:19] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:44:19] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-12 16:44:19] [INFO ] Invariant cache hit.
[2023-03-12 16:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:19] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/292 places, 454/807 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1359 ms. Remains : 62/292 places, 454/807 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), (OR (NOT p2) p1), p1, (OR (AND (NOT p0) p2 p1) (AND (NOT p1) (NOT p2))), p1]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s17 1) (EQ s58 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s47 1) (EQ s58 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s30 1) (EQ s58 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-04 finished in 1877 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)))'
Support contains 4 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 9 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-12 16:44:20] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 16:44:20] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 16:44:20] [INFO ] Invariant cache hit.
[2023-03-12 16:44:20] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2023-03-12 16:44:20] [INFO ] Invariant cache hit.
[2023-03-12 16:44:21] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1115 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-05 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 s17 1) (EQ s57 1) (EQ s257 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 111 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-05 finished in 1229 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)))'
Support contains 4 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 8 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-12 16:44:21] [INFO ] Invariant cache hit.
[2023-03-12 16:44:21] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-12 16:44:21] [INFO ] Invariant cache hit.
[2023-03-12 16:44:22] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-12 16:44:22] [INFO ] Invariant cache hit.
[2023-03-12 16:44:23] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1547 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-06 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 s14 1) (EQ s51 1) (EQ s257 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 104 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-06 finished in 1703 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(F(X((G(p0)&&p1))))))) U p0))'
Support contains 10 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 18 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-12 16:44:23] [INFO ] Invariant cache hit.
[2023-03-12 16:44:23] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 16:44:23] [INFO ] Invariant cache hit.
[2023-03-12 16:44:26] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2023-03-12 16:44:26] [INFO ] Invariant cache hit.
[2023-03-12 16:44:26] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3613 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s81 1) (EQ s111 1) (EQ s131 1) (EQ s156 1) (EQ s181 1) (EQ s206 1) (EQ s231 1) (EQ s258 1)), p1:(EQ s261 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 14 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-08 finished in 4101 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((X(p0)||p1)))||p0)) U p2))'
Support contains 7 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 7 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-12 16:44:27] [INFO ] Invariant cache hit.
[2023-03-12 16:44:27] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-12 16:44:27] [INFO ] Invariant cache hit.
[2023-03-12 16:44:28] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2023-03-12 16:44:28] [INFO ] Invariant cache hit.
[2023-03-12 16:44:28] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p0), true, (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s6 1) (EQ s92 1) (EQ s257 1)), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s192 1) (EQ s257 1)), p0:(AND (EQ s4 1) (EQ s17 1) (EQ s55 1) (EQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-09 finished in 1545 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(((p1 U (p2||F(p3)))||p0))))'
Support contains 14 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Applied a total of 0 rules in 10 ms. Remains 292 /292 variables (removed 0) and now considering 807/807 (removed 0) transitions.
// Phase 1: matrix 807 rows 292 cols
[2023-03-12 16:44:28] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-12 16:44:29] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 16:44:29] [INFO ] Invariant cache hit.
[2023-03-12 16:44:29] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-12 16:44:29] [INFO ] Invariant cache hit.
[2023-03-12 16:44:29] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 292/292 places, 807/807 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p3:(AND (EQ s4 1) (EQ s15 1) (EQ s202 1) (EQ s258 1)), p2:(AND (EQ s61 1) (EQ s81 1) (EQ s106 1) (EQ s131 1) (EQ s161 1) (EQ s181 1) (EQ s212 1) (EQ s232 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-10 finished in 1268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 261 edges and 292 vertex of which 4 / 292 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 289 transition count 698
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 153 rules applied. Total rules applied 260 place count 183 transition count 651
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 288 place count 155 transition count 651
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 288 place count 155 transition count 645
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 300 place count 149 transition count 645
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 301 place count 148 transition count 644
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 148 transition count 644
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 420 place count 89 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 89 transition count 583
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 431 place count 79 transition count 509
Iterating global reduction 4 with 10 rules applied. Total rules applied 441 place count 79 transition count 509
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 449 place count 79 transition count 501
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 453 place count 77 transition count 499
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 455 place count 75 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 456 place count 74 transition count 497
Applied a total of 456 rules in 71 ms. Remains 74 /292 variables (removed 218) and now considering 497/807 (removed 310) transitions.
// Phase 1: matrix 497 rows 74 cols
[2023-03-12 16:44:30] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:44:30] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-12 16:44:30] [INFO ] Invariant cache hit.
[2023-03-12 16:44:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:44:30] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 521 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/292 places, 497/807 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 71 transition count 496
Applied a total of 2 rules in 43 ms. Remains 71 /72 variables (removed 1) and now considering 496/497 (removed 1) transitions.
// Phase 1: matrix 496 rows 71 cols
[2023-03-12 16:44:30] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:44:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-12 16:44:30] [INFO ] Invariant cache hit.
[2023-03-12 16:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:31] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/292 places, 496/807 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1092 ms. Remains : 71/292 places, 496/807 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s19 0) (EQ s26 0) (EQ s33 0) (EQ s40 0) (EQ s47 0) (EQ s54 0) (EQ s63 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 144 reset in 194 ms.
Product exploration explored 100000 steps with 43 reset in 158 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 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 6756 steps, including 327 resets, run visited all 1 properties in 57 ms. (steps per millisecond=118 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 496/496 transitions.
Applied a total of 0 rules in 36 ms. Remains 71 /71 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-12 16:44:32] [INFO ] Invariant cache hit.
[2023-03-12 16:44:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-12 16:44:32] [INFO ] Invariant cache hit.
[2023-03-12 16:44:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:32] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-12 16:44:32] [INFO ] Redundant transitions in 72 ms returned [309]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 495 rows 71 cols
[2023-03-12 16:44:32] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 16:44:33] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/71 places, 495/496 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 69 transition count 493
Applied a total of 2 rules in 16 ms. Remains 69 /71 variables (removed 2) and now considering 493/495 (removed 2) transitions.
// Phase 1: matrix 493 rows 69 cols
[2023-03-12 16:44:33] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:44:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 16:44:33] [INFO ] Invariant cache hit.
[2023-03-12 16:44:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:33] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/71 places, 493/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1340 ms. Remains : 69/71 places, 493/496 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 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 5286 steps, including 270 resets, run visited all 1 properties in 49 ms. (steps per millisecond=107 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 367 reset in 114 ms.
Product exploration explored 100000 steps with 352 reset in 121 ms.
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 493/493 transitions.
Applied a total of 0 rules in 13 ms. Remains 69 /69 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2023-03-12 16:44:34] [INFO ] Invariant cache hit.
[2023-03-12 16:44:34] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 16:44:34] [INFO ] Invariant cache hit.
[2023-03-12 16:44:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:34] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-12 16:44:34] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-12 16:44:34] [INFO ] Invariant cache hit.
[2023-03-12 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 939 ms. Remains : 69/69 places, 493/493 transitions.
Treatment of property AutonomousCar-PT-08b-LTLFireability-11 finished in 5354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 275 edges and 292 vertex of which 4 / 292 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 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 289 transition count 699
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 152 rules applied. Total rules applied 258 place count 184 transition count 652
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 286 place count 156 transition count 652
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 286 place count 156 transition count 646
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 298 place count 150 transition count 646
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 299 place count 149 transition count 645
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 149 transition count 645
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 434 place count 82 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 82 transition count 576
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 450 place count 67 transition count 456
Iterating global reduction 4 with 15 rules applied. Total rules applied 465 place count 67 transition count 456
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 472 place count 67 transition count 449
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 476 place count 65 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 478 place count 63 transition count 445
Applied a total of 478 rules in 65 ms. Remains 63 /292 variables (removed 229) and now considering 445/807 (removed 362) transitions.
// Phase 1: matrix 445 rows 63 cols
[2023-03-12 16:44:35] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:44:35] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 16:44:35] [INFO ] Invariant cache hit.
[2023-03-12 16:44:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:44:36] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 555 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/292 places, 445/807 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 60 transition count 444
Applied a total of 2 rules in 21 ms. Remains 60 /61 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 60 cols
[2023-03-12 16:44:36] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:44:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-12 16:44:36] [INFO ] Invariant cache hit.
[2023-03-12 16:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:36] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/292 places, 444/807 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1172 ms. Remains : 60/292 places, 444/807 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s12 0) (EQ s56 0)), p1:(OR (EQ s1 0) (EQ s9 0) (EQ s47 0) (EQ s56 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2662 reset in 313 ms.
Product exploration explored 100000 steps with 218 reset in 93 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), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:44:37] [INFO ] Invariant cache hit.
[2023-03-12 16:44:37] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:44:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:44:38] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:38] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:38] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 16:44:38] [INFO ] After 405ms 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 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 444/444 transitions.
Graph (complete) has 721 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 59 transition count 441
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 58 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 58 transition count 432
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 58 transition count 423
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 23 place count 49 transition count 423
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 48 transition count 424
Applied a total of 25 rules in 60 ms. Remains 48 /60 variables (removed 12) and now considering 424/444 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 48/60 places, 424/444 transitions.
Finished random walk after 8705 steps, including 83 resets, run visited all 1 properties in 87 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 444/444 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-12 16:44:39] [INFO ] Invariant cache hit.
[2023-03-12 16:44:39] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 16:44:39] [INFO ] Invariant cache hit.
[2023-03-12 16:44:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:39] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-12 16:44:40] [INFO ] Redundant transitions in 34 ms returned [297]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 443 rows 60 cols
[2023-03-12 16:44:40] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:44:40] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/60 places, 443/444 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 58 transition count 441
Applied a total of 2 rules in 22 ms. Remains 58 /60 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 58 cols
[2023-03-12 16:44:40] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:44:40] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-12 16:44:40] [INFO ] Invariant cache hit.
[2023-03-12 16:44:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:40] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/60 places, 441/444 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1510 ms. Remains : 58/60 places, 441/444 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 598 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:44:41] [INFO ] Invariant cache hit.
[2023-03-12 16:44:41] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:44:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-12 16:44:41] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:41] [INFO ] After 40ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:44:41] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 16:44:41] [INFO ] After 406ms 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 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Graph (complete) has 714 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 57 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 56 transition count 430
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 56 transition count 430
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 56 transition count 421
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 47 transition count 421
Applied a total of 22 rules in 56 ms. Remains 47 /58 variables (removed 11) and now considering 421/441 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 47/58 places, 421/441 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished Best-First random walk after 353 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=353 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 697 reset in 99 ms.
Product exploration explored 100000 steps with 447 reset in 128 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 15 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2023-03-12 16:44:42] [INFO ] Invariant cache hit.
[2023-03-12 16:44:43] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-12 16:44:43] [INFO ] Invariant cache hit.
[2023-03-12 16:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:43] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-12 16:44:43] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 16:44:43] [INFO ] Invariant cache hit.
[2023-03-12 16:44:43] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 58/58 places, 441/441 transitions.
Treatment of property AutonomousCar-PT-08b-LTLFireability-12 finished in 8522 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)||G(F(p1)))))'
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Graph (trivial) has 273 edges and 292 vertex of which 4 / 292 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 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 289 transition count 701
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 150 rules applied. Total rules applied 254 place count 186 transition count 654
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 282 place count 158 transition count 654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 282 place count 158 transition count 648
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 294 place count 152 transition count 648
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 295 place count 151 transition count 647
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 151 transition count 647
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 430 place count 84 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 431 place count 84 transition count 578
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 445 place count 70 transition count 466
Iterating global reduction 4 with 14 rules applied. Total rules applied 459 place count 70 transition count 466
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 465 place count 70 transition count 460
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 469 place count 68 transition count 458
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 471 place count 66 transition count 456
Applied a total of 471 rules in 69 ms. Remains 66 /292 variables (removed 226) and now considering 456/807 (removed 351) transitions.
// Phase 1: matrix 456 rows 66 cols
[2023-03-12 16:44:44] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:44:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-12 16:44:44] [INFO ] Invariant cache hit.
[2023-03-12 16:44:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:44:44] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 628 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/292 places, 456/807 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 455
Applied a total of 2 rules in 38 ms. Remains 63 /64 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 63 cols
[2023-03-12 16:44:44] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-12 16:44:45] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 16:44:45] [INFO ] Invariant cache hit.
[2023-03-12 16:44:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:44:45] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/292 places, 455/807 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1510 ms. Remains : 63/292 places, 455/807 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s5 1) (EQ s53 1) (EQ s59 1)) (AND (EQ s1 1) (EQ s10 1) (EQ s16 1) (EQ s59 1))), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s28 1) (EQ s59 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 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-13 finished in 1639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X(G(p0)))))'
Support contains 9 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 7 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-12 16:44:45] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 16:44:45] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 16:44:45] [INFO ] Invariant cache hit.
[2023-03-12 16:44:46] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-12 16:44:46] [INFO ] Invariant cache hit.
[2023-03-12 16:44:46] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s56 1) (NEQ s81 1) (NEQ s106 1) (NEQ s131 1) (NEQ s161 1) (NEQ s181 1) (NEQ s211 1) (NEQ s231 1) (NEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 217 ms.
Entered a terminal (fully accepting) state of product in 215 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-14 finished in 1376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 807/807 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 291 transition count 806
Applied a total of 2 rules in 8 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-12 16:44:47] [INFO ] Invariant cache hit.
[2023-03-12 16:44:47] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 16:44:47] [INFO ] Invariant cache hit.
[2023-03-12 16:44:47] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-12 16:44:47] [INFO ] Invariant cache hit.
[2023-03-12 16:44:48] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/292 places, 806/807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s12 1) (EQ s151 1) (EQ s257 1)), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s151 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-15 finished in 1466 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2023-03-12 16:44:49] [INFO ] Flatten gal took : 138 ms
[2023-03-12 16:44:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 16:44:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 292 places, 807 transitions and 7276 arcs took 12 ms.
Total runtime 58137 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1263/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1263/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-08b-LTLFireability-11
Could not compute solution for formula : AutonomousCar-PT-08b-LTLFireability-12

BK_STOP 1678639489838

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-08b-LTLFireability-11
ltl formula formula --ltl=/tmp/1263/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 292 places, 807 transitions and 7276 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.140 real 0.040 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1263/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1263/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1263/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1263/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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:
ltl formula name AutonomousCar-PT-08b-LTLFireability-12
ltl formula formula --ltl=/tmp/1263/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 292 places, 807 transitions and 7276 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.120 real 0.050 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1263/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1263/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1263/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1263/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 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)

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-08b"
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-08b, 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-167813598200652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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