About the Execution of 2023-gold for AutonomousCar-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 467.571 | 25284.00 | 51579.00 | 674.20 | FTFTFTFFFFFFTFFF | 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.r043-smll-171620180300183.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 gold2023
Input is AutonomousCar-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 159K 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-05b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716306857448
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:54:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:54:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:54:20] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-21 15:54:20] [INFO ] Transformed 255 places.
[2024-05-21 15:54:20] [INFO ] Transformed 490 transitions.
[2024-05-21 15:54:20] [INFO ] Found NUPN structural information;
[2024-05-21 15:54:20] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 222 transition count 457
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 222 transition count 457
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 166 place count 222 transition count 357
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 171 place count 217 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 176 place count 217 transition count 352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 216 transition count 351
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 216 transition count 351
Applied a total of 178 rules in 128 ms. Remains 216 /255 variables (removed 39) and now considering 351/490 (removed 139) transitions.
// Phase 1: matrix 351 rows 216 cols
[2024-05-21 15:54:20] [INFO ] Computed 10 invariants in 26 ms
[2024-05-21 15:54:20] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 15:54:20] [INFO ] Invariant cache hit.
[2024-05-21 15:54:21] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-21 15:54:21] [INFO ] Invariant cache hit.
[2024-05-21 15:54:21] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/255 places, 351/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 216/255 places, 351/490 transitions.
Support contains 38 out of 216 places after structural reductions.
[2024-05-21 15:54:21] [INFO ] Flatten gal took : 89 ms
[2024-05-21 15:54:21] [INFO ] Flatten gal took : 40 ms
[2024-05-21 15:54:22] [INFO ] Input system was already deterministic with 351 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 33) seen :21
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2024-05-21 15:54:23] [INFO ] Invariant cache hit.
[2024-05-21 15:54:23] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 15:54:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 15:54:23] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-21 15:54:24] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-21 15:54:24] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 198 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 691 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 211 transition count 263
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 113 rules applied. Total rules applied 198 place count 130 transition count 231
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 217 place count 111 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 217 place count 111 transition count 226
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 227 place count 106 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 231 place count 102 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 235 place count 102 transition count 222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 238 place count 99 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 241 place count 99 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 245 place count 99 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 97 transition count 207
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 331 place count 55 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 55 transition count 164
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 338 place count 49 transition count 131
Iterating global reduction 6 with 6 rules applied. Total rules applied 344 place count 49 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 347 place count 49 transition count 128
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 7 with 2 rules applied. Total rules applied 349 place count 48 transition count 127
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 356 place count 48 transition count 120
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 363 place count 41 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 364 place count 41 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 40 transition count 119
Applied a total of 365 rules in 126 ms. Remains 40 /216 variables (removed 176) and now considering 119/351 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 40/216 places, 119/351 transitions.
Finished random walk after 5431 steps, including 75 resets, run visited all 3 properties in 24 ms. (steps per millisecond=226 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-05b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&X(X(F(p2)))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 344
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 207 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 207 transition count 342
Applied a total of 18 rules in 15 ms. Remains 207 /216 variables (removed 9) and now considering 342/351 (removed 9) transitions.
// Phase 1: matrix 342 rows 207 cols
[2024-05-21 15:54:24] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 15:54:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 15:54:25] [INFO ] Invariant cache hit.
[2024-05-21 15:54:25] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-21 15:54:25] [INFO ] Invariant cache hit.
[2024-05-21 15:54:25] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 342/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 207/216 places, 342/351 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s12 0) (EQ s146 0) (EQ s173 0)), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s146 1) (EQ s173 1)), p2:(EQ s27 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 12 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 1407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p0))||G(F(p0))))'
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 345
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 209 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 209 transition count 344
Applied a total of 14 rules in 14 ms. Remains 209 /216 variables (removed 7) and now considering 344/351 (removed 7) transitions.
// Phase 1: matrix 344 rows 209 cols
[2024-05-21 15:54:26] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 15:54:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 15:54:26] [INFO ] Invariant cache hit.
[2024-05-21 15:54:26] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 15:54:26] [INFO ] Invariant cache hit.
[2024-05-21 15:54:26] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/216 places, 344/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 209/216 places, 344/351 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-02 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(p2))))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 201 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 213 transition count 264
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 115 rules applied. Total rules applied 200 place count 129 transition count 233
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 218 place count 111 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 218 place count 111 transition count 227
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 230 place count 105 transition count 227
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 235 place count 100 transition count 222
Iterating global reduction 3 with 5 rules applied. Total rules applied 240 place count 100 transition count 222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 97 transition count 211
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 97 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 250 place count 97 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 252 place count 95 transition count 207
Performed 40 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 332 place count 55 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 333 place count 55 transition count 165
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 339 place count 49 transition count 131
Iterating global reduction 6 with 6 rules applied. Total rules applied 345 place count 49 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 347 place count 49 transition count 129
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 7 with 2 rules applied. Total rules applied 349 place count 48 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 48 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 46 transition count 126
Applied a total of 352 rules in 63 ms. Remains 46 /216 variables (removed 170) and now considering 126/351 (removed 225) transitions.
// Phase 1: matrix 126 rows 46 cols
[2024-05-21 15:54:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 15:54:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 15:54:27] [INFO ] Invariant cache hit.
[2024-05-21 15:54:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:54:27] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [41, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 162 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/216 places, 126/351 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 125
Applied a total of 2 rules in 8 ms. Remains 43 /44 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 43 cols
[2024-05-21 15:54:27] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:54:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 15:54:27] [INFO ] Invariant cache hit.
[2024-05-21 15:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:27] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/216 places, 125/351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 43/216 places, 125/351 transitions.
Stuttering acceptance computed with spot in 134 ms :[(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))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s1 1) (EQ s5 1) (EQ s16 1) (EQ s39 1)) (AND (EQ s1 1) (EQ s5 1) (EQ s31 1) (EQ s39 1))), p2:(AND (EQ s1 1) (EQ s5 1) (EQ s31 1) (EQ s39 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 28 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 249 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 194 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(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))]
Incomplete random walk after 10000 steps, including 576 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 15:54:28] [INFO ] Invariant cache hit.
[2024-05-21 15:54:28] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 15:54:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 15:54:29] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 15:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:29] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 15:54:29] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-21 15:54:29] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 125/125 transitions.
Graph (complete) has 344 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 42 transition count 122
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 10 place count 42 transition count 115
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 35 transition count 115
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 35 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 34 transition count 116
Applied a total of 19 rules in 27 ms. Remains 34 /43 variables (removed 9) and now considering 116/125 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 34/43 places, 116/125 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 139133 steps, run visited all 2 properties in 544 ms. (steps per millisecond=255 )
Probabilistic random walk after 139133 steps, saw 25525 distinct states, run finished after 544 ms. (steps per millisecond=255 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND (NOT p0) p2)), (F (AND p0 p2))]
Knowledge based reduction with 13 factoid took 614 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(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))]
Stuttering acceptance computed with spot in 127 ms :[(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))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-21 15:54:30] [INFO ] Invariant cache hit.
[2024-05-21 15:54:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 15:54:30] [INFO ] Invariant cache hit.
[2024-05-21 15:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-21 15:54:30] [INFO ] Redundant transitions in 17 ms returned [62]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 43 cols
[2024-05-21 15:54:30] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 15:54:31] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 124/125 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 122
Applied a total of 2 rules in 9 ms. Remains 41 /43 variables (removed 2) and now considering 122/124 (removed 2) transitions.
// Phase 1: matrix 122 rows 41 cols
[2024-05-21 15:54:31] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:54:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 15:54:31] [INFO ] Invariant cache hit.
[2024-05-21 15:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:31] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/43 places, 122/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 448 ms. Remains : 41/43 places, 122/125 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 288 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(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))]
Incomplete random walk after 10000 steps, including 633 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 15:54:32] [INFO ] Invariant cache hit.
[2024-05-21 15:54:32] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 15:54:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 15:54:32] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 15:54:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:32] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 15:54:32] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-21 15:54:32] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 122/122 transitions.
Graph (complete) has 337 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 120
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 40 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 33 transition count 113
Applied a total of 16 rules in 24 ms. Remains 33 /41 variables (removed 8) and now considering 113/122 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 33/41 places, 113/122 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 152411 steps, run visited all 2 properties in 442 ms. (steps per millisecond=344 )
Probabilistic random walk after 152411 steps, saw 28302 distinct states, run finished after 446 ms. (steps per millisecond=341 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND (NOT p0) p2)), (F (AND p0 p2))]
Knowledge based reduction with 13 factoid took 699 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(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))]
Stuttering acceptance computed with spot in 149 ms :[(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))]
Stuttering acceptance computed with spot in 130 ms :[(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))]
Product exploration explored 100000 steps with 49 reset in 209 ms.
Product exploration explored 100000 steps with 43 reset in 166 ms.
Built C files in :
/tmp/ltsmin8507484674436122872
[2024-05-21 15:54:34] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2024-05-21 15:54:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:54:34] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2024-05-21 15:54:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:54:34] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2024-05-21 15:54:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:54:34] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8507484674436122872
Running compilation step : cd /tmp/ltsmin8507484674436122872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin8507484674436122872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8507484674436122872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9884609355092976586.hoa' '--buchi-type=spotba'
LTSmin run took 887 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 9141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (G((!p2&&X(!p2))) U p3)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 200 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 213 transition count 267
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 111 rules applied. Total rules applied 193 place count 132 transition count 237
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 212 place count 114 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 113 transition count 236
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 213 place count 113 transition count 230
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 225 place count 107 transition count 230
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 229 place count 103 transition count 226
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 103 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 101 transition count 220
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 101 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 101 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 100 transition count 218
Performed 40 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 320 place count 60 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 321 place count 60 transition count 176
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 329 place count 52 transition count 131
Iterating global reduction 7 with 8 rules applied. Total rules applied 337 place count 52 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 340 place count 52 transition count 128
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 8 with 2 rules applied. Total rules applied 342 place count 51 transition count 127
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 51 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 345 place count 49 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 346 place count 48 transition count 125
Applied a total of 346 rules in 63 ms. Remains 48 /216 variables (removed 168) and now considering 125/351 (removed 226) transitions.
// Phase 1: matrix 125 rows 48 cols
[2024-05-21 15:54:36] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [42, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 176 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/216 places, 125/351 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 124
Applied a total of 2 rules in 5 ms. Remains 45 /46 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 45 cols
[2024-05-21 15:54:36] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/216 places, 124/351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 423 ms. Remains : 45/216 places, 124/351 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p3), true, (NOT p1), p2, (NOT p3), (AND (NOT p1) p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s36 1), p1:(EQ s40 1), p0:(EQ s19 1), p2:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-06 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p1)))||p0)))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 345
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 208 transition count 343
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 208 transition count 343
Applied a total of 16 rules in 10 ms. Remains 208 /216 variables (removed 8) and now considering 343/351 (removed 8) transitions.
// Phase 1: matrix 343 rows 208 cols
[2024-05-21 15:54:36] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 15:54:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 15:54:36] [INFO ] Invariant cache hit.
[2024-05-21 15:54:37] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-21 15:54:37] [INFO ] Invariant cache hit.
[2024-05-21 15:54:37] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 343/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 208/216 places, 343/351 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (EQ s193 1) (AND (EQ s4 1) (EQ s14 1) (EQ s83 1) (EQ s173 1))), p1:(EQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 5 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((p1||G(F((p2||G(p1)))))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 202 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 214 transition count 266
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 112 rules applied. Total rules applied 196 place count 131 transition count 237
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 214 place count 114 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 113 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 215 place count 113 transition count 228
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 231 place count 105 transition count 228
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 236 place count 100 transition count 223
Iterating global reduction 4 with 5 rules applied. Total rules applied 241 place count 100 transition count 223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 97 transition count 212
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 97 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 251 place count 97 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 253 place count 95 transition count 208
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 331 place count 56 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 332 place count 56 transition count 167
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 340 place count 48 transition count 122
Iterating global reduction 7 with 8 rules applied. Total rules applied 348 place count 48 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 351 place count 48 transition count 119
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 8 with 2 rules applied. Total rules applied 353 place count 47 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 47 transition count 118
Applied a total of 354 rules in 51 ms. Remains 47 /216 variables (removed 169) and now considering 118/351 (removed 233) transitions.
// Phase 1: matrix 118 rows 47 cols
[2024-05-21 15:54:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 15:54:37] [INFO ] Implicit Places using invariants in 96 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/216 places, 118/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 46/216 places, 118/351 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 1), p1:(EQ s9 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 6 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-08 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&F(p1))))||(p2&&G(p3)))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 199 edges and 216 vertex of which 2 / 216 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 214 transition count 267
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 111 rules applied. Total rules applied 194 place count 132 transition count 238
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 211 place count 115 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 211 place count 115 transition count 232
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 223 place count 109 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 227 place count 105 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 105 transition count 228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 234 place count 102 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 237 place count 102 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 239 place count 102 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 101 transition count 215
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 326 place count 58 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 58 transition count 170
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 335 place count 50 transition count 125
Iterating global reduction 6 with 8 rules applied. Total rules applied 343 place count 50 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 346 place count 50 transition count 122
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 7 with 2 rules applied. Total rules applied 348 place count 49 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 47 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 351 place count 46 transition count 119
Applied a total of 351 rules in 44 ms. Remains 46 /216 variables (removed 170) and now considering 119/351 (removed 232) transitions.
// Phase 1: matrix 119 rows 46 cols
[2024-05-21 15:54:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 15:54:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 15:54:37] [INFO ] Invariant cache hit.
[2024-05-21 15:54:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [38, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/216 places, 119/351 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 118
Applied a total of 2 rules in 7 ms. Remains 43 /44 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 43 cols
[2024-05-21 15:54:38] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 15:54:38] [INFO ] Invariant cache hit.
[2024-05-21 15:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/216 places, 118/351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 43/216 places, 118/351 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s8 1), p2:(EQ s35 1), p3:(EQ s8 0), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 344
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 207 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 207 transition count 342
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 342/351 (removed 9) transitions.
// Phase 1: matrix 342 rows 207 cols
[2024-05-21 15:54:38] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 15:54:38] [INFO ] Invariant cache hit.
[2024-05-21 15:54:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 15:54:38] [INFO ] Invariant cache hit.
[2024-05-21 15:54:39] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 342/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 207/216 places, 342/351 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s12 1) (EQ s123 1) (EQ s173 1)), p1:(EQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-10 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!p1) U p2)&&G(p3)&&p0)))'
Support contains 12 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 344
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 207 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 207 transition count 342
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 342/351 (removed 9) transitions.
[2024-05-21 15:54:39] [INFO ] Invariant cache hit.
[2024-05-21 15:54:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 15:54:39] [INFO ] Invariant cache hit.
[2024-05-21 15:54:39] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-21 15:54:39] [INFO ] Invariant cache hit.
[2024-05-21 15:54:39] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 342/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 207/216 places, 342/351 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) p1), (NOT p3), (OR (NOT p3) p1), true, (OR (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p3), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) p1) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=1 dest: 3}, { cond=(OR p1 (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(OR p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(AND (EQ s4 1) (EQ s14 1) (EQ s108 1) (EQ s173 1)), p2:(AND (EQ s52 1) (EQ s77 1) (EQ s97 1) (EQ s127 1) (EQ s147 1) (EQ s174 1)), p1:(AND (EQ s4 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(p0) U (p1 U p0)))&&X((X(p1)&&p2))))'
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 345
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 209 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 209 transition count 344
Applied a total of 14 rules in 7 ms. Remains 209 /216 variables (removed 7) and now considering 344/351 (removed 7) transitions.
// Phase 1: matrix 344 rows 209 cols
[2024-05-21 15:54:40] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 15:54:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 15:54:40] [INFO ] Invariant cache hit.
[2024-05-21 15:54:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 15:54:40] [INFO ] Invariant cache hit.
[2024-05-21 15:54:40] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/216 places, 344/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 209/216 places, 344/351 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), true, p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p2:(OR (EQ s4 0) (EQ s6 0) (EQ s144 0) (EQ s175 0)), p0:(EQ s78 1), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s67 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 351/351 transitions.
Graph (trivial) has 203 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 213 transition count 263
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 116 rules applied. Total rules applied 202 place count 128 transition count 232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 220 place count 110 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 220 place count 110 transition count 226
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 232 place count 104 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 237 place count 99 transition count 221
Iterating global reduction 3 with 5 rules applied. Total rules applied 242 place count 99 transition count 221
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 96 transition count 210
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 96 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 96 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 94 transition count 206
Performed 41 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 336 place count 53 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 53 transition count 163
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 344 place count 46 transition count 124
Iterating global reduction 6 with 7 rules applied. Total rules applied 351 place count 46 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 354 place count 46 transition count 121
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 7 with 2 rules applied. Total rules applied 356 place count 45 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 43 transition count 118
Applied a total of 358 rules in 34 ms. Remains 43 /216 variables (removed 173) and now considering 118/351 (removed 233) transitions.
// Phase 1: matrix 118 rows 43 cols
[2024-05-21 15:54:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 15:54:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 15:54:41] [INFO ] Invariant cache hit.
[2024-05-21 15:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:54:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [38, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/216 places, 118/351 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 117
Applied a total of 2 rules in 4 ms. Remains 40 /41 variables (removed 1) and now considering 117/118 (removed 1) transitions.
// Phase 1: matrix 117 rows 40 cols
[2024-05-21 15:54:41] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 15:54:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:54:41] [INFO ] Invariant cache hit.
[2024-05-21 15:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:54:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/216 places, 117/351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 40/216 places, 117/351 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s6 1) (NEQ s19 1) (NEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 47 reset in 125 ms.
Stack based approach found an accepted trace after 562 steps with 32 reset with depth 79 and stack size 79 in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 532 ms.
All properties solved by simple procedures.
Total runtime 21529 ms.
BK_STOP 1716306882732
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is AutonomousCar-PT-05b, 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 r043-smll-171620180300183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b 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 ;