About the Execution of GreatSPN+red for AutonomousCar-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3980.535 | 667093.00 | 745296.00 | 2181.70 | FFTFFFTFTFFFTFFT | normal |
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-171620166400316.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-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716349760054
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-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:49:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:49:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:49:22] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2024-05-22 03:49:22] [INFO ] Transformed 73 places.
[2024-05-22 03:49:22] [INFO ] Transformed 593 transitions.
[2024-05-22 03:49:22] [INFO ] Found NUPN structural information;
[2024-05-22 03:49:22] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 137 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 73 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (removed 9) transitions.
// Phase 1: matrix 371 rows 71 cols
[2024-05-22 03:49:23] [INFO ] Computed 11 invariants in 45 ms
[2024-05-22 03:49:23] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-22 03:49:23] [INFO ] Invariant cache hit.
[2024-05-22 03:49:24] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-22 03:49:24] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 861 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 69/73 places, 371/380 transitions.
Support contains 40 out of 69 places after structural reductions.
[2024-05-22 03:49:25] [INFO ] Flatten gal took : 199 ms
[2024-05-22 03:49:25] [INFO ] Flatten gal took : 124 ms
[2024-05-22 03:49:25] [INFO ] Input system was already deterministic with 371 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (2150 resets) in 3476 ms. (11 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40004 steps (167 resets) in 129 ms. (307 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (163 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (161 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (210 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (224 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (166 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 108 ms. (367 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (208 resets) in 165 ms. (240 steps per ms) remains 5/6 properties
// Phase 1: matrix 371 rows 69 cols
[2024-05-22 03:49:26] [INFO ] Computed 9 invariants in 8 ms
[2024-05-22 03:49:26] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/61 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 364/425 variables, 61/70 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 191/261 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/261 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/438 variables, 7/268 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/268 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/439 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 270 constraints, problems are : Problem set: 3 solved, 2 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/60 variables, 6/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/422 variables, 60/69 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 191/260 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/435 variables, 5/265 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/267 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/439 variables, 4/271 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/271 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 272 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1828ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3289 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 68 transition count 358
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 59 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 59 transition count 357
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 58 transition count 357
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 52 transition count 316
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 52 transition count 316
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 2 with 6 rules applied. Total rules applied 42 place count 49 transition count 313
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 49 transition count 306
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 105 place count 42 transition count 257
Applied a total of 105 rules in 196 ms. Remains 42 /69 variables (removed 27) and now considering 257/371 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 42/69 places, 257/371 transitions.
RANDOM walk for 40000 steps (28 resets) in 676 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (270 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 11320 steps, run visited all 2 properties in 126 ms. (steps per millisecond=89 )
Probabilistic random walk after 11320 steps, saw 2327 distinct states, run finished after 140 ms. (steps per millisecond=80 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
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 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
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 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 32 place count 53 transition count 314
Applied a total of 32 rules in 86 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-22 03:49:33] [INFO ] Computed 9 invariants in 5 ms
[2024-05-22 03:49:33] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 03:49:33] [INFO ] Invariant cache hit.
[2024-05-22 03:49:33] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-22 03:49:33] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-22 03:49:33] [INFO ] Redundant transitions in 55 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-22 03:49:34] [INFO ] Invariant cache hit.
[2024-05-22 03:49:34] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 03:49:45] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 15 ms to minimize.
[2024-05-22 03:49:45] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26548 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 59050ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 59064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59723 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 275 reset in 543 ms.
Product exploration explored 100000 steps with 45 reset in 242 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 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 21537 steps (1345 resets) in 302 ms. (71 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 39 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 03:50:35] [INFO ] Invariant cache hit.
[2024-05-22 03:50:35] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 03:50:35] [INFO ] Invariant cache hit.
[2024-05-22 03:50:35] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-22 03:50:35] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-22 03:50:35] [INFO ] Redundant transitions in 31 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-22 03:50:35] [INFO ] Invariant cache hit.
[2024-05-22 03:50:35] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 03:50:47] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 3 ms to minimize.
[2024-05-22 03:50:47] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26411 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 58488ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 58496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59071 ms. Remains : 53/53 places, 314/314 transitions.
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 p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 29338 steps (1895 resets) in 245 ms. (119 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 79 reset in 171 ms.
Product exploration explored 100000 steps with 70 reset in 225 ms.
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 34 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 03:51:35] [INFO ] Invariant cache hit.
[2024-05-22 03:51:35] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 03:51:35] [INFO ] Invariant cache hit.
[2024-05-22 03:51:36] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-22 03:51:36] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-22 03:51:36] [INFO ] Redundant transitions in 19 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-22 03:51:36] [INFO ] Invariant cache hit.
[2024-05-22 03:51:36] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 03:51:47] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 3 ms to minimize.
[2024-05-22 03:51:48] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26771 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 58670ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 58674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59162 ms. Remains : 53/53 places, 314/314 transitions.
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 181958 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)||F((G(p2)&&p1)))))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 5 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-22 03:52:35] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 03:52:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 03:52:35] [INFO ] Invariant cache hit.
[2024-05-22 03:52:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-22 03:52:35] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-22 03:52:35] [INFO ] Invariant cache hit.
[2024-05-22 03:52:35] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 03:52:45] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 2 ms to minimize.
[2024-05-22 03:52:46] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 2 ms to minimize.
[2024-05-22 03:52:46] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 2 ms to minimize.
[2024-05-22 03:52:49] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 61990ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 61996ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62345 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 62686 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(p0)||X(F(((!p1 U (p2||G(!p1))) U (((F(!p3) U ((!p4&&F(!p3))||G(F(!p3))))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
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 16 place count 61 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 56 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 55 transition count 322
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 30 place count 54 transition count 322
Applied a total of 30 rules in 66 ms. Remains 54 /69 variables (removed 15) and now considering 322/371 (removed 49) transitions.
// Phase 1: matrix 322 rows 54 cols
[2024-05-22 03:53:38] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 03:53:38] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 03:53:38] [INFO ] Invariant cache hit.
[2024-05-22 03:53:38] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-22 03:53:38] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-22 03:53:38] [INFO ] Redundant transitions in 25 ms returned []
Running 321 sub problems to find dead transitions.
[2024-05-22 03:53:38] [INFO ] Invariant cache hit.
[2024-05-22 03:53:38] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 321/375 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-05-22 03:53:48] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2024-05-22 03:53:49] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 224 constraints, problems are : Problem set: 0 solved, 321 unsolved in 27034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 321/375 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 158/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 321/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 545 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
After SMT, in 59047ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 59056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 322/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59573 ms. Remains : 54/69 places, 322/371 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02
Product exploration explored 100000 steps with 113 reset in 205 ms.
Product exploration explored 100000 steps with 192 reset in 227 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 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 282 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 5 states, 12 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
RANDOM walk for 40000 steps (2601 resets) in 665 ms. (60 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (194 resets) in 839 ms. (47 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (201 resets) in 317 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (135 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (194 resets) in 508 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (317 resets) in 411 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (252 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (167 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
[2024-05-22 03:54:40] [INFO ] Invariant cache hit.
[2024-05-22 03:54:40] [INFO ] State equation strengthened by 159 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 49/376 variables, and 9 constraints, problems are : Problem set: 8 solved, 0 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/54 constraints, ReadFeed: 0/159 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 p1 (NOT p4)) (OR p0 (NOT p4) (NOT p2)))), (G (AND (OR p0 (NOT p1) (NOT p3) p2) (OR p0 (NOT p3) p4))), (G (OR p0 p1 p2)), (G (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p3) (NOT p2)))), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p4))), (G (AND (OR p0 p1 (NOT p3) p4) (OR p0 (NOT p3) p4 (NOT p2)))), (G (OR p0 (NOT p1) (NOT p3) p2))]
False Knowledge obtained : [(F p3), (F p1), (F p4), (F (NOT p2)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 31 factoid took 22 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 62718 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((F(p0)&&(F(p1)||X(G(p2))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 7 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-22 03:54:40] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 03:54:40] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 03:54:40] [INFO ] Invariant cache hit.
[2024-05-22 03:54:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-22 03:54:41] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-22 03:54:41] [INFO ] Invariant cache hit.
[2024-05-22 03:54:41] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 03:54:50] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-05-22 03:54:50] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-05-22 03:54:50] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 2 ms to minimize.
[2024-05-22 03:54:54] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 62034ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 62041ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62588 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-04
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-04 finished in 62931 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(p0))&&(X(!p1) U (p2 U p3))))'
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-22 03:55:43] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 03:55:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 03:55:43] [INFO ] Invariant cache hit.
[2024-05-22 03:55:43] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-22 03:55:43] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-22 03:55:44] [INFO ] Invariant cache hit.
[2024-05-22 03:55:44] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-22 03:55:53] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 2 ms to minimize.
[2024-05-22 03:55:53] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 2 ms to minimize.
[2024-05-22 03:55:54] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 61778ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 61785ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62222 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p3) (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p3), (AND p1 (NOT p3)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 62579 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)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 8 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2024-05-22 03:56:46] [INFO ] Computed 9 invariants in 11 ms
[2024-05-22 03:56:46] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 03:56:46] [INFO ] Invariant cache hit.
[2024-05-22 03:56:46] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-22 03:56:46] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-05-22 03:56:46] [INFO ] Invariant cache hit.
[2024-05-22 03:56:46] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 330/394 variables, 64/73 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 156/229 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-05-22 03:56:56] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 3 ms to minimize.
[2024-05-22 03:56:57] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 5 ms to minimize.
[2024-05-22 03:56:57] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 2 ms to minimize.
[2024-05-22 03:57:00] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 234 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 330/394 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 156/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 330/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 564 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
After SMT, in 62078ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 62082ms
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62690 ms. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-11 finished in 62800 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(F(p0)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 5 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-22 03:57:48] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 03:57:49] [INFO ] Implicit Places using invariants in 191 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 1415 ms.
Product exploration explored 100000 steps with 50000 reset in 1119 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 2850 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(F(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
[2024-05-22 03:57:51] [INFO ] Invariant cache hit.
[2024-05-22 03:57:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 03:57:51] [INFO ] Invariant cache hit.
[2024-05-22 03:57:52] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-22 03:57:52] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-22 03:57:52] [INFO ] Invariant cache hit.
[2024-05-22 03:57:52] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-22 03:58:01] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2024-05-22 03:58:01] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2024-05-22 03:58:01] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 25053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 57021ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 57025ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57374 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 57548 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((((p1 U p2)||(p3 U p2))&&p0)))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
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 32 place count 53 transition count 314
Applied a total of 32 rules in 59 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-22 03:58:49] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 03:58:49] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 03:58:49] [INFO ] Invariant cache hit.
[2024-05-22 03:58:49] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-22 03:58:49] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-22 03:58:49] [INFO ] Redundant transitions in 22 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-22 03:58:49] [INFO ] Invariant cache hit.
[2024-05-22 03:58:49] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 03:59:00] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2024-05-22 03:59:01] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 25894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 57724ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 57730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58258 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-14
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 58519 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))))'
[2024-05-22 03:59:48] [INFO ] Flatten gal took : 121 ms
[2024-05-22 03:59:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-22 03:59:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 371 transitions and 3688 arcs took 18 ms.
Total runtime 626123 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-07a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 69
TRANSITIONS: 371
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.009s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1221
MODEL NAME: /home/mcc/execution/413/model
69 places, 371 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716350427147
--------------------
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-07a"
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-07a, 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-171620166400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a 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 '
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 ;