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.r005-oct2-167813593400652.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 itstools
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 r005-oct2-167813593400652
=====================================================================

--------------------
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 1678521874047

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 08:04:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 08:04:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:04:37] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-11 08:04:37] [INFO ] Transformed 357 places.
[2023-03-11 08:04:37] [INFO ] Transformed 1128 transitions.
[2023-03-11 08:04:37] [INFO ] Found NUPN structural information;
[2023-03-11 08:04:37] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 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 80 ms. Remains 292 /357 variables (removed 65) and now considering 807/1128 (removed 321) transitions.
// Phase 1: matrix 807 rows 292 cols
[2023-03-11 08:04:37] [INFO ] Computed 13 place invariants in 17 ms
[2023-03-11 08:04:37] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-11 08:04:37] [INFO ] Invariant cache hit.
[2023-03-11 08:04:38] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-11 08:04:38] [INFO ] Invariant cache hit.
[2023-03-11 08:04:38] [INFO ] Dead Transitions using invariants and state equation in 360 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 1106 ms. Remains : 292/357 places, 807/1128 transitions.
Support contains 41 out of 292 places after structural reductions.
[2023-03-11 08:04:38] [INFO ] Flatten gal took : 154 ms
[2023-03-11 08:04:38] [INFO ] Flatten gal took : 75 ms
[2023-03-11 08:04:39] [INFO ] Input system was already deterministic with 807 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 27) seen :8
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
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) 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 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 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 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 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 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-11 08:04:39] [INFO ] Invariant cache hit.
[2023-03-11 08:04:40] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:04:41] [INFO ] After 1286ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-11 08:04:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-11 08:04:43] [INFO ] After 1646ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-11 08:04:45] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 6 ms to minimize.
[2023-03-11 08:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2023-03-11 08:04:45] [INFO ] After 3976ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 1350 ms.
[2023-03-11 08:04:47] [INFO ] After 5815ms 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 180 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 233 edges and 292 vertex of which 4 / 292 are part of one of the 2 SCC in 3 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.5 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 146 rules applied. Total rules applied 248 place count 190 transition count 655
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 276 place count 162 transition count 655
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 276 place count 162 transition count 649
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 288 place count 156 transition count 649
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 388 place count 106 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 389 place count 106 transition count 598
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 391 place count 104 transition count 589
Iterating global reduction 4 with 2 rules applied. Total rules applied 393 place count 104 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 394 place count 104 transition count 588
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 5 with 2 rules applied. Total rules applied 396 place count 103 transition count 587
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 419 place count 103 transition count 564
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 442 place count 80 transition count 564
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 447 place count 80 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 79 transition count 563
Applied a total of 448 rules in 204 ms. Remains 79 /292 variables (removed 213) and now considering 563/807 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 79/292 places, 563/807 transitions.
Incomplete random walk after 10000 steps, including 388 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 563 rows 79 cols
[2023-03-11 08:04:48] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 08:04:48] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:48] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 08:04:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned sat
[2023-03-11 08:04:49] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 08:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:49] [INFO ] After 209ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 08:04:49] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-11 08:04:49] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 563/563 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 79 transition count 562
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 78 transition count 562
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 77 transition count 554
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 77 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 77 transition count 553
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 68 transition count 544
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 66 transition count 526
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 66 transition count 526
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 61 transition count 521
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 61 transition count 515
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 55 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 54 transition count 474
Applied a total of 90 rules in 91 ms. Remains 54 /79 variables (removed 25) and now considering 474/563 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 54/79 places, 474/563 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 474 rows 54 cols
[2023-03-11 08:04:50] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 08:04:50] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:50] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 08:04:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:50] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 08:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:50] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 08:04:50] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-11 08:04:50] [INFO ] After 439ms 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 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 474/474 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 465
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 464
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 52 transition count 456
Applied a total of 12 rules in 50 ms. Remains 52 /54 variables (removed 2) and now considering 456/474 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 52/54 places, 456/474 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 572462 steps, run visited all 1 properties in 1048 ms. (steps per millisecond=546 )
Probabilistic random walk after 572462 steps, saw 81736 distinct states, run finished after 1049 ms. (steps per millisecond=545 ) 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 8 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-11 08:04:52] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-11 08:04:53] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-11 08:04:53] [INFO ] Invariant cache hit.
[2023-03-11 08:04:54] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
[2023-03-11 08:04:54] [INFO ] Invariant cache hit.
[2023-03-11 08:04:54] [INFO ] Dead Transitions using invariants and state equation in 386 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 1954 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 546 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 2599 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 18 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-11 08:04:55] [INFO ] Invariant cache hit.
[2023-03-11 08:04:55] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-11 08:04:55] [INFO ] Invariant cache hit.
[2023-03-11 08:04:56] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-11 08:04:56] [INFO ] Invariant cache hit.
[2023-03-11 08:04:56] [INFO ] Dead Transitions using invariants and state equation in 305 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 1094 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 83 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 1209 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 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 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 168 ms. Remains 65 /292 variables (removed 227) and now considering 455/807 (removed 352) transitions.
// Phase 1: matrix 455 rows 65 cols
[2023-03-11 08:04:56] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 08:04:56] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-11 08:04:56] [INFO ] Invariant cache hit.
[2023-03-11 08:04:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:04:57] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 441 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 0 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 25 ms. Remains 62 /63 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 62 cols
[2023-03-11 08:04:57] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 08:04:57] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-11 08:04:57] [INFO ] Invariant cache hit.
[2023-03-11 08:04:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:57] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 539 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 1175 ms. Remains : 62/292 places, 454/807 transitions.
Stuttering acceptance computed with spot in 497 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 15 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 1719 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 32 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-11 08:04:58] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-11 08:04:58] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-11 08:04:58] [INFO ] Invariant cache hit.
[2023-03-11 08:04:59] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-11 08:04:59] [INFO ] Invariant cache hit.
[2023-03-11 08:04:59] [INFO ] Dead Transitions using invariants and state equation in 387 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 1411 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 132 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 110 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-05 finished in 1582 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 13 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-11 08:04:59] [INFO ] Invariant cache hit.
[2023-03-11 08:05:00] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-11 08:05:00] [INFO ] Invariant cache hit.
[2023-03-11 08:05:00] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-11 08:05:00] [INFO ] Invariant cache hit.
[2023-03-11 08:05:00] [INFO ] Dead Transitions using invariants and state equation in 404 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 1234 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 69 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 113 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-06 finished in 1329 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 11 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-11 08:05:01] [INFO ] Invariant cache hit.
[2023-03-11 08:05:01] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-11 08:05:01] [INFO ] Invariant cache hit.
[2023-03-11 08:05:01] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-11 08:05:01] [INFO ] Invariant cache hit.
[2023-03-11 08:05:02] [INFO ] Dead Transitions using invariants and state equation in 518 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 1165 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 331 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 128 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-08 finished in 1516 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 8 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-11 08:05:02] [INFO ] Invariant cache hit.
[2023-03-11 08:05:02] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-11 08:05:02] [INFO ] Invariant cache hit.
[2023-03-11 08:05:03] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-11 08:05:03] [INFO ] Invariant cache hit.
[2023-03-11 08:05:03] [INFO ] Dead Transitions using invariants and state equation in 455 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 1297 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 201 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 1515 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 4 ms. Remains 292 /292 variables (removed 0) and now considering 807/807 (removed 0) transitions.
// Phase 1: matrix 807 rows 292 cols
[2023-03-11 08:05:04] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-11 08:05:04] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-11 08:05:04] [INFO ] Invariant cache hit.
[2023-03-11 08:05:04] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-11 08:05:04] [INFO ] Invariant cache hit.
[2023-03-11 08:05:05] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 292/292 places, 807/807 transitions.
Stuttering acceptance computed with spot in 339 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 113 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-10 finished in 1422 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 79 ms. Remains 74 /292 variables (removed 218) and now considering 497/807 (removed 310) transitions.
// Phase 1: matrix 497 rows 74 cols
[2023-03-11 08:05:05] [INFO ] Computed 11 place invariants in 17 ms
[2023-03-11 08:05:05] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-11 08:05:05] [INFO ] Invariant cache hit.
[2023-03-11 08:05:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:05:06] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 585 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 60 ms. Remains 71 /72 variables (removed 1) and now considering 496/497 (removed 1) transitions.
// Phase 1: matrix 496 rows 71 cols
[2023-03-11 08:05:06] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 08:05:06] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-11 08:05:06] [INFO ] Invariant cache hit.
[2023-03-11 08:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:05:06] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 502 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 1226 ms. Remains : 71/292 places, 496/807 transitions.
Stuttering acceptance computed with spot in 39 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 354 reset in 244 ms.
Product exploration explored 100000 steps with 3 reset in 128 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 220 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 58 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 459 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Finished Best-First random walk after 919 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=459 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 210 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 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 88 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 40 ms. Remains 71 /71 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-11 08:05:08] [INFO ] Invariant cache hit.
[2023-03-11 08:05:08] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-11 08:05:08] [INFO ] Invariant cache hit.
[2023-03-11 08:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:05:08] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-11 08:05:08] [INFO ] Redundant transitions in 73 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-11 08:05:08] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-11 08:05:08] [INFO ] Dead Transitions using invariants and state equation in 201 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-11 08:05:08] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 08:05:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 08:05:08] [INFO ] Invariant cache hit.
[2023-03-11 08:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:05:09] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 433 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 1327 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 168 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 59 ms :[(NOT p0)]
Finished random walk after 8333 steps, including 385 resets, run visited all 1 properties in 67 ms. (steps per millisecond=124 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Product exploration explored 100000 steps with 72 reset in 129 ms.
Product exploration explored 100000 steps with 34 reset in 141 ms.
Built C files in :
/tmp/ltsmin7724846863108272458
[2023-03-11 08:05:10] [INFO ] Computing symmetric may disable matrix : 493 transitions.
[2023-03-11 08:05:10] [INFO ] Computation of Complete disable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:10] [INFO ] Computing symmetric may enable matrix : 493 transitions.
[2023-03-11 08:05:10] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:10] [INFO ] Computing Do-Not-Accords matrix : 493 transitions.
[2023-03-11 08:05:10] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:10] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7724846863108272458
Running compilation step : cd /tmp/ltsmin7724846863108272458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1812 ms.
Running link step : cd /tmp/ltsmin7724846863108272458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin7724846863108272458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5169825110549700061.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 17 ms. Remains 69 /69 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2023-03-11 08:05:25] [INFO ] Invariant cache hit.
[2023-03-11 08:05:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 08:05:25] [INFO ] Invariant cache hit.
[2023-03-11 08:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:05:25] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-11 08:05:25] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-11 08:05:25] [INFO ] Invariant cache hit.
[2023-03-11 08:05:26] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 818 ms. Remains : 69/69 places, 493/493 transitions.
Built C files in :
/tmp/ltsmin11830327077262903173
[2023-03-11 08:05:26] [INFO ] Computing symmetric may disable matrix : 493 transitions.
[2023-03-11 08:05:26] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:26] [INFO ] Computing symmetric may enable matrix : 493 transitions.
[2023-03-11 08:05:26] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:26] [INFO ] Computing Do-Not-Accords matrix : 493 transitions.
[2023-03-11 08:05:26] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:05:26] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11830327077262903173
Running compilation step : cd /tmp/ltsmin11830327077262903173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin11830327077262903173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin11830327077262903173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5885053689854296522.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 08:05:41] [INFO ] Flatten gal took : 63 ms
[2023-03-11 08:05:41] [INFO ] Flatten gal took : 84 ms
[2023-03-11 08:05:41] [INFO ] Time to serialize gal into /tmp/LTL12712453062644764221.gal : 11 ms
[2023-03-11 08:05:41] [INFO ] Time to serialize properties into /tmp/LTL5221145145810659625.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12712453062644764221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1827390027070624635.hoa' '-atoms' '/tmp/LTL5221145145810659625.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5221145145810659625.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1827390027070624635.hoa
Detected timeout of ITS tools.
[2023-03-11 08:05:56] [INFO ] Flatten gal took : 57 ms
[2023-03-11 08:05:56] [INFO ] Flatten gal took : 53 ms
[2023-03-11 08:05:56] [INFO ] Time to serialize gal into /tmp/LTL9291130316654891621.gal : 7 ms
[2023-03-11 08:05:56] [INFO ] Time to serialize properties into /tmp/LTL12275847113859682510.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9291130316654891621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12275847113859682510.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p62==0)||(p93==0))||((p124==0)||(p155==0)))||(((p186==0)||(p217==0))||((p248==0)||(p285==0))))||(p315==0))"))))
Formula 0 simplified : GF!"(((((p62==0)||(p93==0))||((p124==0)||(p155==0)))||(((p186==0)||(p217==0))||((p248==0)||(p285==0))))||(p315==0))"
Detected timeout of ITS tools.
[2023-03-11 08:06:11] [INFO ] Flatten gal took : 119 ms
[2023-03-11 08:06:11] [INFO ] Applying decomposition
[2023-03-11 08:06:12] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16997454878070251537.txt' '-o' '/tmp/graph16997454878070251537.bin' '-w' '/tmp/graph16997454878070251537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16997454878070251537.bin' '-l' '-1' '-v' '-w' '/tmp/graph16997454878070251537.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:06:12] [INFO ] Decomposing Gal with order
[2023-03-11 08:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:06:12] [INFO ] Removed a total of 2800 redundant transitions.
[2023-03-11 08:06:12] [INFO ] Flatten gal took : 119 ms
[2023-03-11 08:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 15 ms.
[2023-03-11 08:06:12] [INFO ] Time to serialize gal into /tmp/LTL15511387343222274871.gal : 2 ms
[2023-03-11 08:06:12] [INFO ] Time to serialize properties into /tmp/LTL13218408973937386681.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15511387343222274871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13218408973937386681.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i0.u0.p62==0)||(i0.u4.p93==0))||((i0.u6.p124==0)||(i0.u9.p155==0)))||(((i0.u13.p186==0)||(i0.u16.p217==0))||((i0.u19.p248...203
Formula 0 simplified : GF!"(((((i0.u0.p62==0)||(i0.u4.p93==0))||((i0.u6.p124==0)||(i0.u9.p155==0)))||(((i0.u13.p186==0)||(i0.u16.p217==0))||((i0.u19.p248==...197
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7929708188188797638
[2023-03-11 08:06:27] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7929708188188797638
Running compilation step : cd /tmp/ltsmin7929708188188797638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1190 ms.
Running link step : cd /tmp/ltsmin7929708188188797638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin7929708188188797638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08b-LTLFireability-11 finished in 97225 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 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 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 82 ms. Remains 63 /292 variables (removed 229) and now considering 445/807 (removed 362) transitions.
// Phase 1: matrix 445 rows 63 cols
[2023-03-11 08:06:42] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-11 08:06:43] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-11 08:06:43] [INFO ] Invariant cache hit.
[2023-03-11 08:06:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:06:43] [INFO ] Implicit Places using invariants and state equation in 471 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 737 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 25 ms. Remains 60 /61 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 60 cols
[2023-03-11 08:06:43] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 08:06:43] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-11 08:06:43] [INFO ] Invariant cache hit.
[2023-03-11 08:06:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:06:44] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 769 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 1627 ms. Remains : 60/292 places, 444/807 transitions.
Stuttering acceptance computed with spot in 152 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 170 reset in 171 ms.
Stuttering criterion allowed to conclude after 16316 steps with 898 reset in 103 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-12 finished in 2072 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 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 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 1 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 74 ms. Remains 66 /292 variables (removed 226) and now considering 456/807 (removed 351) transitions.
// Phase 1: matrix 456 rows 66 cols
[2023-03-11 08:06:44] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-11 08:06:45] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-11 08:06:45] [INFO ] Invariant cache hit.
[2023-03-11 08:06:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:06:45] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 665 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 52 ms. Remains 63 /64 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 63 cols
[2023-03-11 08:06:45] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 08:06:45] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-11 08:06:45] [INFO ] Invariant cache hit.
[2023-03-11 08:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:06:46] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 630 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 1422 ms. Remains : 63/292 places, 455/807 transitions.
Stuttering acceptance computed with spot in 150 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 15 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 1602 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 17 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-11 08:06:46] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-11 08:06:46] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-11 08:06:46] [INFO ] Invariant cache hit.
[2023-03-11 08:06:47] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-11 08:06:47] [INFO ] Invariant cache hit.
[2023-03-11 08:06:47] [INFO ] Dead Transitions using invariants and state equation in 317 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 1099 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 222 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]]
Entered a terminal (fully accepting) state of product in 6301 steps with 56 reset in 26 ms.
FORMULA AutonomousCar-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLFireability-14 finished in 1375 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 11 ms. Remains 291 /292 variables (removed 1) and now considering 806/807 (removed 1) transitions.
[2023-03-11 08:06:47] [INFO ] Invariant cache hit.
[2023-03-11 08:06:48] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-11 08:06:48] [INFO ] Invariant cache hit.
[2023-03-11 08:06:48] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2023-03-11 08:06:48] [INFO ] Invariant cache hit.
[2023-03-11 08:06:49] [INFO ] Dead Transitions using invariants and state equation in 479 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 1359 ms. Remains : 291/292 places, 806/807 transitions.
Stuttering acceptance computed with spot in 182 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 105 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 1576 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)))'
[2023-03-11 08:06:49] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4249102439787864252
[2023-03-11 08:06:49] [INFO ] Computing symmetric may disable matrix : 807 transitions.
[2023-03-11 08:06:49] [INFO ] Applying decomposition
[2023-03-11 08:06:49] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:06:49] [INFO ] Computing symmetric may enable matrix : 807 transitions.
[2023-03-11 08:06:49] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:06:49] [INFO ] Flatten gal took : 49 ms
[2023-03-11 08:06:49] [INFO ] Computing Do-Not-Accords matrix : 807 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8924267506978327277.txt' '-o' '/tmp/graph8924267506978327277.bin' '-w' '/tmp/graph8924267506978327277.weights'
[2023-03-11 08:06:49] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8924267506978327277.bin' '-l' '-1' '-v' '-w' '/tmp/graph8924267506978327277.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:06:49] [INFO ] Decomposing Gal with order
[2023-03-11 08:06:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:06:50] [INFO ] Built C files in 289ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4249102439787864252
Running compilation step : cd /tmp/ltsmin4249102439787864252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 08:06:50] [INFO ] Removed a total of 3052 redundant transitions.
[2023-03-11 08:06:50] [INFO ] Flatten gal took : 97 ms
[2023-03-11 08:06:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 31 ms.
[2023-03-11 08:06:50] [INFO ] Time to serialize gal into /tmp/LTLFireability14181820040055054100.gal : 5 ms
[2023-03-11 08:06:50] [INFO ] Time to serialize properties into /tmp/LTLFireability14217135150605929417.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14181820040055054100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14217135150605929417.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i3.u19.p62==0)||(i3.u28.p93==0))||((i3.u38.p124==0)||(i3.u48.p155==0)))||(((i3.u58.p186==0)||(i3.u68.p217==0))||((i3.u78....208
Formula 0 simplified : GF!"(((((i3.u19.p62==0)||(i3.u28.p93==0))||((i3.u38.p124==0)||(i3.u48.p155==0)))||(((i3.u58.p186==0)||(i3.u68.p217==0))||((i3.u78.p2...202
Compilation finished in 2782 ms.
Running link step : cd /tmp/ltsmin4249102439787864252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin4249102439787864252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 08:27:36] [INFO ] Applying decomposition
[2023-03-11 08:27:37] [INFO ] Flatten gal took : 660 ms
[2023-03-11 08:27:38] [INFO ] Decomposing Gal with order
[2023-03-11 08:27:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:27:39] [INFO ] Removed a total of 3274 redundant transitions.
[2023-03-11 08:27:39] [INFO ] Flatten gal took : 944 ms
[2023-03-11 08:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 212 ms.
[2023-03-11 08:27:40] [INFO ] Time to serialize gal into /tmp/LTLFireability5989254070212646872.gal : 42 ms
[2023-03-11 08:27:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16437046199007072864.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5989254070212646872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16437046199007072864.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p62==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p93==0))||((i1.i0.i0.i0.i0.i0.i0.i0.u15.p124==0)|...340
Formula 0 simplified : GF!"(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p62==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p93==0))||((i1.i0.i0.i0.i0.i0.i0.i0.u15.p124==0)||(...334
Reverse transition relation is NOT exact ! Due to transitions t287, t487, i0.u2.t277, i0.u3.t275, i1.t804, i1.i0.u21.t33, i1.i0.u21.t36, i1.i0.u21.t37, i1....1714
Computing Next relation with stutter on 1.76282e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16069 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,160.749,2072096,1,0,2.64781e+06,429474,5931,1.21507e+07,1478,2.26993e+06,683402
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-08b-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1809989 ms.

BK_STOP 1678523688800

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r005-oct2-167813593400652"
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 ;