Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166400332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 448K May 18 16:42 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-08a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716353281133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 04:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:48:04] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-05-22 04:48:04] [INFO ] Transformed 81 places.
[2024-05-22 04:48:04] [INFO ] Transformed 849 transitions.
[2024-05-22 04:48:04] [INFO ] Found NUPN structural information;
[2024-05-22 04:48:04] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 748 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 79 transition count 564
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 79 transition count 564
Applied a total of 4 rules in 73 ms. Remains 79 /81 variables (removed 2) and now considering 564/574 (removed 10) transitions.
// Phase 1: matrix 564 rows 79 cols
[2024-05-22 04:48:05] [INFO ] Computed 12 invariants in 48 ms
[2024-05-22 04:48:05] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-22 04:48:05] [INFO ] Invariant cache hit.
[2024-05-22 04:48:05] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-22 04:48:06] [INFO ] Implicit Places using invariants and state equation in 593 ms returned [75, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1047 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/81 places, 564/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 77 /77 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1167 ms. Remains : 77/81 places, 564/574 transitions.
Support contains 43 out of 77 places after structural reductions.
[2024-05-22 04:48:06] [INFO ] Flatten gal took : 330 ms
[2024-05-22 04:48:06] [INFO ] Flatten gal took : 182 ms
[2024-05-22 04:48:07] [INFO ] Input system was already deterministic with 564 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (2063 resets) in 5185 ms. (7 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (13 resets) in 34 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (13 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (19 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (20 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (13 resets) in 29 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (18 resets) in 32 ms. (121 steps per ms) remains 13/13 properties
// Phase 1: matrix 564 rows 77 cols
[2024-05-22 04:48:08] [INFO ] Computed 10 invariants in 10 ms
[2024-05-22 04:48:09] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/69 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 557/626 variables, 69/79 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 250/329 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/329 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 13/639 variables, 7/336 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/336 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/640 variables, 1/337 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/337 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/641 variables, 1/338 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/338 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/641 variables, 0/338 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 338 constraints, problems are : Problem set: 5 solved, 8 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 77/77 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 46/69 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 557/626 variables, 69/79 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 250/329 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/329 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 13/639 variables, 7/336 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 8/344 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/344 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/640 variables, 1/345 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 0/345 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/641 variables, 1/346 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/346 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/641 variables, 0/346 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 346 constraints, problems are : Problem set: 5 solved, 8 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 77/77 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6864ms problems are : Problem set: 5 solved, 8 unsolved
Parikh walk visited 6 properties in 20808 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 564/564 transitions.
Graph (complete) has 832 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 551
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 67 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 66 transition count 550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 66 transition count 549
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 65 transition count 549
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 33 place count 58 transition count 494
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 58 transition count 494
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 55 transition count 491
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 53 place count 55 transition count 484
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 116 place count 48 transition count 428
Applied a total of 116 rules in 216 ms. Remains 48 /77 variables (removed 29) and now considering 428/564 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 48/77 places, 428/564 transitions.
RANDOM walk for 40000 steps (34 resets) in 676 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (148 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 753680 steps, run visited all 2 properties in 2201 ms. (steps per millisecond=342 )
Probabilistic random walk after 753680 steps, saw 97300 distinct states, run finished after 2207 ms. (steps per millisecond=341 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(G(p1))))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 20 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-22 04:48:40] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 04:48:40] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-22 04:48:40] [INFO ] Invariant cache hit.
[2024-05-22 04:48:40] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 04:48:41] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-22 04:48:41] [INFO ] Invariant cache hit.
[2024-05-22 04:48:41] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 518/590 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 04:49:02] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 12 ms to minimize.
[2024-05-22 04:49:02] [INFO ] Deduced a trap composed of 14 places in 345 ms of which 3 ms to minimize.
[2024-05-22 04:49:03] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 2 ms to minimize.
[2024-05-22 04:49:08] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/591 variables, and 296 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 210/211 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 518/590 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 210/296 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 518/814 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 814 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 210/211 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 4/4 constraints]
After SMT, in 66241ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 66262ms
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67260 ms. Remains : 72/77 places, 519/564 transitions.
Stuttering acceptance computed with spot in 544 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6810 steps with 353 reset in 203 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 68245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(!p1)) U X(X(p2))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 519
Applied a total of 10 rules in 22 ms. Remains 72 /77 variables (removed 5) and now considering 519/564 (removed 45) transitions.
// Phase 1: matrix 519 rows 72 cols
[2024-05-22 04:49:48] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 04:49:48] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-22 04:49:48] [INFO ] Invariant cache hit.
[2024-05-22 04:49:48] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 04:49:49] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-22 04:49:49] [INFO ] Invariant cache hit.
[2024-05-22 04:49:49] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 518/590 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 04:50:10] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 2 ms to minimize.
[2024-05-22 04:50:10] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 2 ms to minimize.
[2024-05-22 04:50:11] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 518 unsolved
SMT process timed out in 36157ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 36169ms
Starting structural reductions in LTL mode, iteration 1 : 72/77 places, 519/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37111 ms. Remains : 72/77 places, 519/564 transitions.
Stuttering acceptance computed with spot in 570 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-01 finished in 37718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 501
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 501
Applied a total of 14 rules in 10 ms. Remains 70 /77 variables (removed 7) and now considering 501/564 (removed 63) transitions.
// Phase 1: matrix 501 rows 70 cols
[2024-05-22 04:50:25] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 04:50:25] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 04:50:25] [INFO ] Invariant cache hit.
[2024-05-22 04:50:26] [INFO ] State equation strengthened by 195 read => feed constraints.
[2024-05-22 04:50:26] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 04:50:26] [INFO ] Invariant cache hit.
[2024-05-22 04:50:26] [INFO ] State equation strengthened by 195 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/570 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 194/274 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 04:50:44] [INFO ] Deduced a trap composed of 22 places in 443 ms of which 3 ms to minimize.
[2024-05-22 04:50:45] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 2 ms to minimize.
[2024-05-22 04:50:45] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 500 unsolved
SMT process timed out in 35045ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 35055ms
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 501/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35721 ms. Remains : 70/77 places, 501/564 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 35896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 555
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 68 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 67 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 67 transition count 553
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 66 transition count 553
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 29 place count 59 transition count 490
Iterating global reduction 3 with 7 rules applied. Total rules applied 36 place count 59 transition count 490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 57 transition count 488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 56 transition count 488
Applied a total of 42 rules in 154 ms. Remains 56 /77 variables (removed 21) and now considering 488/564 (removed 76) transitions.
// Phase 1: matrix 488 rows 56 cols
[2024-05-22 04:51:01] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 04:51:02] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-22 04:51:02] [INFO ] Invariant cache hit.
[2024-05-22 04:51:02] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-22 04:51:02] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-22 04:51:02] [INFO ] Redundant transitions in 71 ms returned []
Running 487 sub problems to find dead transitions.
[2024-05-22 04:51:02] [INFO ] Invariant cache hit.
[2024-05-22 04:51:02] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 487/543 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 196/262 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-05-22 04:51:24] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 487 unsolved
SMT process timed out in 36228ms, After SMT, problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 36245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/77 places, 488/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37305 ms. Remains : 56/77 places, 488/564 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-03 finished in 37403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 69 transition count 554
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 554
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 60 transition count 491
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 60 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 59 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 58 transition count 490
Applied a total of 38 rules in 116 ms. Remains 58 /77 variables (removed 19) and now considering 490/564 (removed 74) transitions.
// Phase 1: matrix 490 rows 58 cols
[2024-05-22 04:51:39] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 04:51:39] [INFO ] Implicit Places using invariants in 352 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/77 places, 490/564 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 57/77 places, 490/564 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-05
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-05 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 6 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 04:51:39] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 04:51:40] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 04:51:40] [INFO ] Invariant cache hit.
[2024-05-22 04:51:40] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-22 04:51:40] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-22 04:51:40] [INFO ] Invariant cache hit.
[2024-05-22 04:51:40] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 509/580 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 202/283 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2024-05-22 04:51:58] [INFO ] Deduced a trap composed of 22 places in 459 ms of which 3 ms to minimize.
[2024-05-22 04:51:58] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 2 ms to minimize.
[2024-05-22 04:51:59] [INFO ] Deduced a trap composed of 7 places in 483 ms of which 2 ms to minimize.
[2024-05-22 04:52:05] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
SMT process timed out in 35339ms, After SMT, problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 35351ms
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36046 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 36175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)||G(F(p2))))))'
Support contains 8 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 5 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 04:52:16] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 04:52:16] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 04:52:16] [INFO ] Invariant cache hit.
[2024-05-22 04:52:16] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-22 04:52:16] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-22 04:52:16] [INFO ] Invariant cache hit.
[2024-05-22 04:52:16] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 509/580 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 202/283 constraints. Problems are: Problem set: 0 solved, 509 unsolved
[2024-05-22 04:52:35] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 2 ms to minimize.
[2024-05-22 04:52:36] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
[2024-05-22 04:52:36] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 5 ms to minimize.
[2024-05-22 04:52:42] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 509 unsolved
SMT process timed out in 35505ms, After SMT, problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 35512ms
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 510/564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36284 ms. Remains : 71/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 36607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 557
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 557
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 70 transition count 555
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 68 transition count 555
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 61 transition count 492
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 61 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 transition count 492
Applied a total of 34 rules in 71 ms. Remains 60 /77 variables (removed 17) and now considering 492/564 (removed 72) transitions.
// Phase 1: matrix 492 rows 60 cols
[2024-05-22 04:52:52] [INFO ] Computed 10 invariants in 11 ms
[2024-05-22 04:52:53] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-22 04:52:53] [INFO ] Invariant cache hit.
[2024-05-22 04:52:53] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-22 04:52:53] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-22 04:52:53] [INFO ] Redundant transitions in 60 ms returned []
Running 491 sub problems to find dead transitions.
[2024-05-22 04:52:53] [INFO ] Invariant cache hit.
[2024-05-22 04:52:53] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 491/551 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 196/266 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-22 04:53:20] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 491 unsolved
SMT process timed out in 36061ms, After SMT, problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 36071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/77 places, 492/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37225 ms. Remains : 60/77 places, 492/564 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-11
Product exploration explored 100000 steps with 45 reset in 322 ms.
Product exploration explored 100000 steps with 435 reset in 681 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2493 resets) in 1121 ms. (35 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (151 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
[2024-05-22 04:53:31] [INFO ] Invariant cache hit.
[2024-05-22 04:53:31] [INFO ] State equation strengthened by 197 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 489/544 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 196/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/551 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/552 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 55/552 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/60 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-11 finished in 39738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(!X(G(p0)) U G(((p1 U p0)&&G(p1)))))))'
Support contains 13 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 69 transition count 554
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 61 transition count 500
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 61 transition count 500
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 59 transition count 499
Applied a total of 36 rules in 51 ms. Remains 59 /77 variables (removed 18) and now considering 499/564 (removed 65) transitions.
// Phase 1: matrix 499 rows 59 cols
[2024-05-22 04:53:32] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 04:53:32] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 04:53:32] [INFO ] Invariant cache hit.
[2024-05-22 04:53:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-05-22 04:53:33] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2024-05-22 04:53:33] [INFO ] Redundant transitions in 41 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-22 04:53:33] [INFO ] Invariant cache hit.
[2024-05-22 04:53:33] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (OVERLAPS) 498/557 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-22 04:54:00] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 4 ms to minimize.
[2024-05-22 04:54:01] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 275 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 204/205 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 498/557 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 204/275 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 498/773 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/558 variables, and 773 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, ReadFeed: 204/205 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 2/2 constraints]
After SMT, in 66059ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 66072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/77 places, 499/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66884 ms. Remains : 59/77 places, 499/564 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 209 reset in 152 ms.
Product exploration explored 100000 steps with 559 reset in 258 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (2521 resets) in 1519 ms. (26 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (155 resets) in 317 ms. (125 steps per ms) remains 1/2 properties
[2024-05-22 04:54:40] [INFO ] Invariant cache hit.
[2024-05-22 04:54:40] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 54/558 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/59 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-13 finished in 68601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 77 transition count 554
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 67 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 67 transition count 553
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 66 transition count 553
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 61 transition count 508
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 61 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 59 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 58 transition count 506
Applied a total of 38 rules in 84 ms. Remains 58 /77 variables (removed 19) and now considering 506/564 (removed 58) transitions.
// Phase 1: matrix 506 rows 58 cols
[2024-05-22 04:54:41] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 04:54:41] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-22 04:54:41] [INFO ] Invariant cache hit.
[2024-05-22 04:54:42] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-22 04:54:42] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2024-05-22 04:54:42] [INFO ] Redundant transitions in 33 ms returned []
Running 505 sub problems to find dead transitions.
[2024-05-22 04:54:42] [INFO ] Invariant cache hit.
[2024-05-22 04:54:42] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 505/563 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 212/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 04:55:06] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 505 unsolved
SMT process timed out in 37197ms, After SMT, problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 37208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/77 places, 506/564 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38732 ms. Remains : 58/77 places, 506/564 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-14
Product exploration explored 100000 steps with 93 reset in 136 ms.
Product exploration explored 100000 steps with 35 reset in 136 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2672 resets) in 1359 ms. (29 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (157 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (161 resets) in 554 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (144 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
[2024-05-22 04:55:21] [INFO ] Invariant cache hit.
[2024-05-22 04:55:21] [INFO ] State equation strengthened by 213 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 503/557 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 212/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/563 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 503/557 variables, 54/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 212/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/563 variables, 4/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 2/282 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/564 variables, 1/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 283 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1486ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 584 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 506/506 transitions.
Graph (complete) has 772 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 57 transition count 503
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 57 transition count 494
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 85 place count 48 transition count 430
Applied a total of 85 rules in 48 ms. Remains 48 /58 variables (removed 10) and now considering 430/506 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 48/58 places, 430/506 transitions.
RANDOM walk for 40000 steps (217 resets) in 881 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (217 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (219 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 714648 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 2
Probabilistic random walk after 714648 steps, saw 95042 distinct states, run finished after 3009 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 430 rows 48 cols
[2024-05-22 04:55:26] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 04:55:26] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/45 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 430/478 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 148/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/45 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 430/478 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 148/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/478 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 597 ms.
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 430/430 transitions.
Applied a total of 0 rules in 33 ms. Remains 48 /48 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 48/48 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 430/430 transitions.
Applied a total of 0 rules in 21 ms. Remains 48 /48 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-05-22 04:55:28] [INFO ] Invariant cache hit.
[2024-05-22 04:55:28] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-22 04:55:28] [INFO ] Invariant cache hit.
[2024-05-22 04:55:28] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-22 04:55:29] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-22 04:55:29] [INFO ] Redundant transitions in 4 ms returned []
Running 429 sub problems to find dead transitions.
[2024-05-22 04:55:29] [INFO ] Invariant cache hit.
[2024-05-22 04:55:29] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/478 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 148/207 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 207 constraints, problems are : Problem set: 0 solved, 429 unsolved in 22972 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/478 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 148/207 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 429/636 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 636 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints]
After SMT, in 57755ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 57760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58496 ms. Remains : 48/48 places, 430/430 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 48 /48 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 04:56:27] [INFO ] Invariant cache hit.
[2024-05-22 04:56:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:56:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 04:56:27] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 04:56:27] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 04:56:27] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 04:56:27] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 912 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 31 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-14 finished in 107033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((F(p1) U p2)))))'
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 564/564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 510
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 510
Applied a total of 12 rules in 6 ms. Remains 71 /77 variables (removed 6) and now considering 510/564 (removed 54) transitions.
// Phase 1: matrix 510 rows 71 cols
[2024-05-22 04:56:28] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 04:56:28] [INFO ] Implicit Places using invariants in 448 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 510/564 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 70/77 places, 510/564 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 834 ms.
All properties solved by simple procedures.
Total runtime 505160 ms.
ITS solved all properties within timeout

BK_STOP 1716353788967

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-08a, 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 r025-smll-171620166400332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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