Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400620.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678521122034

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:52:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:52:04] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-11 07:52:04] [INFO ] Transformed 289 places.
[2023-03-11 07:52:04] [INFO ] Transformed 644 transitions.
[2023-03-11 07:52:04] [INFO ] Found NUPN structural information;
[2023-03-11 07:52:04] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 250 transition count 605
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 250 transition count 605
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 222 place count 250 transition count 461
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 230 place count 242 transition count 453
Iterating global reduction 1 with 8 rules applied. Total rules applied 238 place count 242 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 241 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 241 transition count 452
Applied a total of 240 rules in 64 ms. Remains 241 /289 variables (removed 48) and now considering 452/644 (removed 192) transitions.
// Phase 1: matrix 452 rows 241 cols
[2023-03-11 07:52:04] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-11 07:52:05] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-11 07:52:05] [INFO ] Invariant cache hit.
[2023-03-11 07:52:05] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-11 07:52:05] [INFO ] Invariant cache hit.
[2023-03-11 07:52:05] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/289 places, 452/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1210 ms. Remains : 241/289 places, 452/644 transitions.
Support contains 45 out of 241 places after structural reductions.
[2023-03-11 07:52:06] [INFO ] Flatten gal took : 83 ms
[2023-03-11 07:52:06] [INFO ] Flatten gal took : 47 ms
[2023-03-11 07:52:06] [INFO ] Input system was already deterministic with 452 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 33) seen :22
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 07:52:07] [INFO ] Invariant cache hit.
[2023-03-11 07:52:07] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:52:07] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:52:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:52:08] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 07:52:08] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-11 07:52:08] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 67 ms.
Support contains 11 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 220 edges and 241 vertex of which 4 / 241 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 876 edges and 239 vertex of which 237 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 86 rules applied. Total rules applied 88 place count 237 transition count 362
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 153 transition count 323
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 234 place count 130 transition count 323
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 234 place count 130 transition count 316
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 248 place count 123 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 119 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 119 transition count 312
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 360 place count 67 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 67 transition count 259
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 369 place count 59 transition count 213
Iterating global reduction 4 with 8 rules applied. Total rules applied 377 place count 59 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 381 place count 59 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 383 place count 58 transition count 208
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 394 place count 58 transition count 197
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 405 place count 47 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 47 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 46 transition count 196
Applied a total of 407 rules in 111 ms. Remains 46 /241 variables (removed 195) and now considering 196/452 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 46/241 places, 196/452 transitions.
Incomplete random walk after 10000 steps, including 207 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Finished Best-First random walk after 364 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=182 )
Computed a total of 41 stabilizing places and 42 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 24 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:52:09] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:52:09] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-11 07:52:09] [INFO ] Invariant cache hit.
[2023-03-11 07:52:10] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-11 07:52:10] [INFO ] Invariant cache hit.
[2023-03-11 07:52:10] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s144 1), p0:(AND (EQ s55 1) (EQ s80 1) (EQ s100 1) (EQ s125 1) (EQ s150 1) (EQ s180 1) (EQ s202 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]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 16 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-00 finished in 1411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 226 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 234 place count 129 transition count 318
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 253 place count 117 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 258 place count 117 transition count 313
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 360 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 373 place count 54 transition count 188
Iterating global reduction 4 with 12 rules applied. Total rules applied 385 place count 54 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 391 place count 54 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 395 place count 52 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 397 place count 50 transition count 178
Applied a total of 397 rules in 82 ms. Remains 50 /241 variables (removed 191) and now considering 178/452 (removed 274) transitions.
// Phase 1: matrix 178 rows 50 cols
[2023-03-11 07:52:11] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:52:11] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-11 07:52:11] [INFO ] Invariant cache hit.
[2023-03-11 07:52:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:52:11] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 628 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/241 places, 178/452 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 47 transition count 177
Applied a total of 2 rules in 17 ms. Remains 47 /48 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 47 cols
[2023-03-11 07:52:11] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:52:11] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 07:52:11] [INFO ] Invariant cache hit.
[2023-03-11 07:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:52:11] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/241 places, 177/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 948 ms. Remains : 47/241 places, 177/452 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s32 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&G(F(p1))&&(X(!p0)||(p2&&X(p3)))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 237 transition count 448
Applied a total of 8 rules in 14 ms. Remains 237 /241 variables (removed 4) and now considering 448/452 (removed 4) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-11 07:52:12] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:52:12] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 07:52:12] [INFO ] Invariant cache hit.
[2023-03-11 07:52:12] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-11 07:52:12] [INFO ] Invariant cache hit.
[2023-03-11 07:52:12] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/241 places, 448/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 237/241 places, 448/452 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) p0), true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s14 1) (EQ s51 1) (EQ s203 1)), p2:(NEQ s177 1), p1:(NEQ s57 1), p3:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 47 reset in 180 ms.
Product exploration explored 100000 steps with 31 reset in 163 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p1), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 237 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 448/448 transitions.
Graph (trivial) has 214 edges and 237 vertex of which 4 / 237 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 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 234 transition count 363
Reduce places removed 82 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 114 rules applied. Total rules applied 197 place count 152 transition count 331
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 217 place count 133 transition count 330
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 220 place count 132 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 131 transition count 328
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 221 place count 131 transition count 321
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 235 place count 124 transition count 321
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 236 place count 123 transition count 320
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 123 transition count 320
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 339 place count 72 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 340 place count 72 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 351 place count 61 transition count 202
Iterating global reduction 6 with 11 rules applied. Total rules applied 362 place count 61 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 61 transition count 197
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 59 transition count 195
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 372 place count 59 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 57 transition count 193
Applied a total of 374 rules in 97 ms. Remains 57 /237 variables (removed 180) and now considering 193/448 (removed 255) transitions.
// Phase 1: matrix 193 rows 57 cols
[2023-03-11 07:52:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:52:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 07:52:14] [INFO ] Invariant cache hit.
[2023-03-11 07:52:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:52:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [52, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 278 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/237 places, 193/448 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 54 transition count 192
Applied a total of 2 rules in 7 ms. Remains 54 /55 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 54 cols
[2023-03-11 07:52:14] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:52:14] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 07:52:14] [INFO ] Invariant cache hit.
[2023-03-11 07:52:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:52:15] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/237 places, 192/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 959 ms. Remains : 54/237 places, 192/448 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 58 reset in 82 ms.
Product exploration explored 100000 steps with 169 reset in 130 ms.
Built C files in :
/tmp/ltsmin6282325560056374566
[2023-03-11 07:52:15] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2023-03-11 07:52:16] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:52:16] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2023-03-11 07:52:16] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:52:16] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2023-03-11 07:52:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:52:16] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6282325560056374566
Running compilation step : cd /tmp/ltsmin6282325560056374566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 606 ms.
Running link step : cd /tmp/ltsmin6282325560056374566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin6282325560056374566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6254739873891648427.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-02 finished in 5036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 5 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:52:17] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:52:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:52:17] [INFO ] Invariant cache hit.
[2023-03-11 07:52:17] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-11 07:52:17] [INFO ] Invariant cache hit.
[2023-03-11 07:52:17] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s14 1) (EQ s151 1) (EQ s201 1)), p0:(OR (EQ s4 0) (EQ s11 0) (EQ s61 0) (EQ s201 0))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 1454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 236 transition count 447
Applied a total of 10 rules in 5 ms. Remains 236 /241 variables (removed 5) and now considering 447/452 (removed 5) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-11 07:52:18] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:52:18] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 07:52:18] [INFO ] Invariant cache hit.
[2023-03-11 07:52:18] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-11 07:52:18] [INFO ] Invariant cache hit.
[2023-03-11 07:52:19] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/241 places, 447/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 236/241 places, 447/452 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s216 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3803 reset in 153 ms.
Product exploration explored 100000 steps with 3789 reset in 146 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/236 stabilizing places and 41/447 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 07:52:20] [INFO ] Invariant cache hit.
[2023-03-11 07:52:21] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:21] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2023-03-11 07:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 07:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:22] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-11 07:52:22] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 2 ms to minimize.
[2023-03-11 07:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-11 07:52:22] [INFO ] Computed and/alt/rep : 209/384/209 causal constraints (skipped 237 transitions) in 56 ms.
[2023-03-11 07:52:23] [INFO ] Added : 170 causal constraints over 34 iterations in 1326 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2023-03-11 07:52:23] [INFO ] Invariant cache hit.
[2023-03-11 07:52:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-11 07:52:23] [INFO ] Invariant cache hit.
[2023-03-11 07:52:24] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-11 07:52:24] [INFO ] Invariant cache hit.
[2023-03-11 07:52:24] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 236/236 places, 447/447 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/236 stabilizing places and 41/447 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 07:52:25] [INFO ] Invariant cache hit.
[2023-03-11 07:52:25] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:25] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-11 07:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:52:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:52:26] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-11 07:52:26] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 26 ms to minimize.
[2023-03-11 07:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-11 07:52:26] [INFO ] Computed and/alt/rep : 209/384/209 causal constraints (skipped 237 transitions) in 33 ms.
[2023-03-11 07:52:27] [INFO ] Added : 170 causal constraints over 34 iterations in 912 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3812 reset in 151 ms.
Product exploration explored 100000 steps with 3775 reset in 126 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Graph (trivial) has 222 edges and 236 vertex of which 4 / 236 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.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 234 transition count 445
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 99 place count 234 transition count 430
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 99 place count 234 transition count 430
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 234 transition count 430
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 189 place count 162 transition count 358
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 261 place count 162 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 261 place count 162 transition count 359
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 162 transition count 359
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 328 place count 162 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 330 place count 162 transition count 366
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 384 place count 108 transition count 246
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 54 rules applied. Total rules applied 438 place count 108 transition count 246
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 450 place count 108 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 457 place count 101 transition count 227
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 464 place count 101 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 101 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 467 place count 99 transition count 225
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 99 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 470 place count 99 transition count 227
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 470 rules in 80 ms. Remains 99 /236 variables (removed 137) and now considering 227/447 (removed 220) transitions.
[2023-03-11 07:52:28] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 227 rows 99 cols
[2023-03-11 07:52:28] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:52:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/236 places, 227/447 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 99/236 places, 227/447 transitions.
Built C files in :
/tmp/ltsmin2326248402201471956
[2023-03-11 07:52:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2326248402201471956
Running compilation step : cd /tmp/ltsmin2326248402201471956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 727 ms.
Running link step : cd /tmp/ltsmin2326248402201471956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2326248402201471956;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1768261397543329725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 447/447 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-11 07:52:43] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-11 07:52:44] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-11 07:52:44] [INFO ] Invariant cache hit.
[2023-03-11 07:52:44] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-11 07:52:44] [INFO ] Invariant cache hit.
[2023-03-11 07:52:44] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 236/236 places, 447/447 transitions.
Built C files in :
/tmp/ltsmin2205461036128506091
[2023-03-11 07:52:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2205461036128506091
Running compilation step : cd /tmp/ltsmin2205461036128506091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 700 ms.
Running link step : cd /tmp/ltsmin2205461036128506091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2205461036128506091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4591262688627391892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:52:59] [INFO ] Flatten gal took : 35 ms
[2023-03-11 07:52:59] [INFO ] Flatten gal took : 49 ms
[2023-03-11 07:52:59] [INFO ] Time to serialize gal into /tmp/LTL2963089295111103063.gal : 6 ms
[2023-03-11 07:52:59] [INFO ] Time to serialize properties into /tmp/LTL10198016251278005500.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2963089295111103063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13037018146477171910.hoa' '-atoms' '/tmp/LTL10198016251278005500.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10198016251278005500.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13037018146477171910.hoa
Detected timeout of ITS tools.
[2023-03-11 07:53:14] [INFO ] Flatten gal took : 26 ms
[2023-03-11 07:53:14] [INFO ] Flatten gal took : 23 ms
[2023-03-11 07:53:14] [INFO ] Time to serialize gal into /tmp/LTL1657372465039615704.gal : 5 ms
[2023-03-11 07:53:14] [INFO ] Time to serialize properties into /tmp/LTL15779297028790816220.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1657372465039615704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15779297028790816220.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(p264==1)")))))))
Formula 0 simplified : XXXXG!"(p264==1)"
Detected timeout of ITS tools.
[2023-03-11 07:53:30] [INFO ] Flatten gal took : 29 ms
[2023-03-11 07:53:30] [INFO ] Applying decomposition
[2023-03-11 07:53:30] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9947345152644608618.txt' '-o' '/tmp/graph9947345152644608618.bin' '-w' '/tmp/graph9947345152644608618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9947345152644608618.bin' '-l' '-1' '-v' '-w' '/tmp/graph9947345152644608618.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:53:30] [INFO ] Decomposing Gal with order
[2023-03-11 07:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:53:30] [INFO ] Removed a total of 841 redundant transitions.
[2023-03-11 07:53:30] [INFO ] Flatten gal took : 122 ms
[2023-03-11 07:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 14 ms.
[2023-03-11 07:53:30] [INFO ] Time to serialize gal into /tmp/LTL3113454166840931064.gal : 5 ms
[2023-03-11 07:53:30] [INFO ] Time to serialize properties into /tmp/LTL3721883962351009698.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3113454166840931064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3721883962351009698.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(i15.i1.u77.p264==1)")))))))
Formula 0 simplified : XXXXG!"(i15.i1.u77.p264==1)"
Reverse transition relation is NOT exact ! Due to transitions t226, t228, t232, t280, t304, t346, t370, t375, t449, i1.u66.t34, i1.u66.t37, i1.u66.t38, i1....820
Computing Next relation with stutter on 84736 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
736 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.3941,287896,1,0,731724,3202,4394,429866,454,26501,1426542
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-06b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-06b-LTLFireability-05 finished in 80684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 6 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:53:39] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:53:39] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 07:53:39] [INFO ] Invariant cache hit.
[2023-03-11 07:53:39] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-11 07:53:39] [INFO ] Invariant cache hit.
[2023-03-11 07:53:39] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s79 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]]
Product exploration explored 100000 steps with 1787 reset in 150 ms.
Product exploration explored 100000 steps with 1787 reset in 207 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
[2023-03-11 07:53:40] [INFO ] Invariant cache hit.
[2023-03-11 07:53:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:53:41] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-11 07:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:53:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:53:41] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-11 07:53:41] [INFO ] Computed and/alt/rep : 208/383/208 causal constraints (skipped 237 transitions) in 78 ms.
[2023-03-11 07:53:43] [INFO ] Added : 180 causal constraints over 37 iterations in 1643 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Graph (trivial) has 220 edges and 235 vertex of which 4 / 235 are part of one of the 2 SCC in 6 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 232 transition count 359
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 121 rules applied. Total rules applied 206 place count 148 transition count 322
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 229 place count 126 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 125 transition count 321
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 230 place count 125 transition count 314
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 244 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 117 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 117 transition count 313
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 352 place count 64 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 64 transition count 258
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 366 place count 51 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 379 place count 51 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 385 place count 51 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 389 place count 49 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 391 place count 47 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 392 place count 46 transition count 169
Applied a total of 392 rules in 85 ms. Remains 46 /235 variables (removed 189) and now considering 169/446 (removed 277) transitions.
// Phase 1: matrix 169 rows 46 cols
[2023-03-11 07:53:43] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:53:43] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 07:53:43] [INFO ] Invariant cache hit.
[2023-03-11 07:53:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:53:43] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [41, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 330 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/235 places, 169/446 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 168
Applied a total of 2 rules in 7 ms. Remains 43 /44 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 43 cols
[2023-03-11 07:53:43] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:53:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 07:53:43] [INFO ] Invariant cache hit.
[2023-03-11 07:53:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:43] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/235 places, 168/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 585 ms. Remains : 43/235 places, 168/446 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
[2023-03-11 07:53:44] [INFO ] Invariant cache hit.
[2023-03-11 07:53:44] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 07:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:53:44] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 07:53:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:53:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 07:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:53:44] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-11 07:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-11 07:53:44] [INFO ] Computed and/alt/rep : 11/48/11 causal constraints (skipped 155 transitions) in 12 ms.
[2023-03-11 07:53:44] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39969 reset in 244 ms.
Product exploration explored 100000 steps with 39938 reset in 195 ms.
Built C files in :
/tmp/ltsmin6699737229695523627
[2023-03-11 07:53:45] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2023-03-11 07:53:45] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:53:45] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2023-03-11 07:53:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:53:45] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2023-03-11 07:53:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:53:45] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6699737229695523627
Running compilation step : cd /tmp/ltsmin6699737229695523627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin6699737229695523627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6699737229695523627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8114340702416656892.hoa' '--buchi-type=spotba'
LTSmin run took 224 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 6880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0)||F(p1)))||((G(p1)&&F(p2)) U p2))))'
Support contains 12 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 22 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:53:46] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:53:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-11 07:53:46] [INFO ] Invariant cache hit.
[2023-03-11 07:53:46] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-11 07:53:46] [INFO ] Invariant cache hit.
[2023-03-11 07:53:46] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s50 1) (EQ s75 1) (EQ s100 1) (EQ s130 1) (EQ s155 1) (EQ s180 1) (EQ s202 1)), p1:(EQ s151 1), p0:(AND (EQ s4 1) (EQ s12 1) (EQ s36 1) (EQ s2...], 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 305 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-07 finished in 849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||G(p2))))'
Support contains 13 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 211 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 234 place count 129 transition count 318
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 253 place count 117 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 258 place count 117 transition count 313
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 3 with 86 rules applied. Total rules applied 344 place count 74 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 74 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 352 place count 67 transition count 230
Iterating global reduction 4 with 7 rules applied. Total rules applied 359 place count 67 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 364 place count 67 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 368 place count 65 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 65 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 370 place count 64 transition count 222
Applied a total of 370 rules in 76 ms. Remains 64 /241 variables (removed 177) and now considering 222/452 (removed 230) transitions.
// Phase 1: matrix 222 rows 64 cols
[2023-03-11 07:53:46] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-11 07:53:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-11 07:53:47] [INFO ] Invariant cache hit.
[2023-03-11 07:53:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:53:47] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 330 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/241 places, 222/452 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 61 transition count 221
Applied a total of 2 rules in 6 ms. Remains 61 /62 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 61 cols
[2023-03-11 07:53:47] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:53:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 07:53:47] [INFO ] Invariant cache hit.
[2023-03-11 07:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:47] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/241 places, 221/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 766 ms. Remains : 61/241 places, 221/452 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0) (EQ s46 0) (EQ s56 0)), p1:(OR (EQ s17 0) (EQ s21 0) (EQ s28 0) (EQ s37 0) (EQ s41 0) (EQ s50 0) (EQ s57 0)), p2:(OR (EQ s2 0) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 59 reset in 136 ms.
Product exploration explored 100000 steps with 116 reset in 79 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 556 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 405 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:53:49] [INFO ] Invariant cache hit.
[2023-03-11 07:53:49] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:53:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 07:53:49] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 13 factoid took 454 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-09 finished in 2875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 226 edges and 241 vertex of which 4 / 241 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 238 transition count 362
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 124 rules applied. Total rules applied 212 place count 151 transition count 325
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 234 place count 129 transition count 325
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 234 place count 129 transition count 317
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 250 place count 121 transition count 317
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 255 place count 116 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 260 place count 116 transition count 312
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 360 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 373 place count 54 transition count 188
Iterating global reduction 4 with 12 rules applied. Total rules applied 385 place count 54 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 391 place count 54 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 395 place count 52 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 51 transition count 179
Applied a total of 396 rules in 21 ms. Remains 51 /241 variables (removed 190) and now considering 179/452 (removed 273) transitions.
// Phase 1: matrix 179 rows 51 cols
[2023-03-11 07:53:49] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:53:49] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-11 07:53:49] [INFO ] Invariant cache hit.
[2023-03-11 07:53:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:53:49] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [46, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 222 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/241 places, 179/452 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 48 transition count 178
Applied a total of 2 rules in 6 ms. Remains 48 /49 variables (removed 1) and now considering 178/179 (removed 1) transitions.
// Phase 1: matrix 178 rows 48 cols
[2023-03-11 07:53:50] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:53:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 07:53:50] [INFO ] Invariant cache hit.
[2023-03-11 07:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:50] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/241 places, 178/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 48/241 places, 178/452 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s17 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-10 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(G((p1||(p2&&X(p3))))))))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 17 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:53:50] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:53:50] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-11 07:53:50] [INFO ] Invariant cache hit.
[2023-03-11 07:53:50] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-11 07:53:50] [INFO ] Invariant cache hit.
[2023-03-11 07:53:50] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 526 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s99 1) (EQ s201 1)), p1:(AND (EQ s4 1) (EQ s13 1) (EQ s120 1) (EQ s201 1)), p2:(OR (EQ s4 0) (EQ s6 0) (EQ s136 0) (EQ s20...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2244 steps with 23 reset in 33 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 1194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(X(p2))&&G(p3)))))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 237 transition count 448
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 237 transition count 448
Applied a total of 8 rules in 7 ms. Remains 237 /241 variables (removed 4) and now considering 448/452 (removed 4) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-11 07:53:51] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-11 07:53:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 07:53:51] [INFO ] Invariant cache hit.
[2023-03-11 07:53:51] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-11 07:53:51] [INFO ] Invariant cache hit.
[2023-03-11 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/241 places, 448/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 237/241 places, 448/452 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 (AND p1 p3)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(AND (EQ s107 0) (EQ s4 1) (EQ s15 1) (EQ s95 1) (EQ s203 1)), p1:(EQ s107 0), p3:(EQ s72 0), p2:(EQ s124 0)], 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 1389 steps with 22 reset in 4 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(!p0&&X((!p0&&X(p1))))))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 446
Applied a total of 12 rules in 6 ms. Remains 235 /241 variables (removed 6) and now considering 446/452 (removed 6) transitions.
// Phase 1: matrix 446 rows 235 cols
[2023-03-11 07:53:52] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:53:52] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-11 07:53:52] [INFO ] Invariant cache hit.
[2023-03-11 07:53:52] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-11 07:53:52] [INFO ] Invariant cache hit.
[2023-03-11 07:53:53] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 446/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 235/241 places, 446/452 transitions.
Stuttering acceptance computed with spot in 235 ms :[p0, p0, false, (AND p0 (NOT p1)), false]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s80 1) (EQ s105 1) (EQ s130 1) (EQ s155 1) (EQ s180 1) (EQ s202 1)), p1:(NEQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 40051 reset in 381 ms.
Product exploration explored 100000 steps with 40020 reset in 304 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-13 finished in 1883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||X((p1||X(p2)))))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 236 transition count 447
Applied a total of 10 rules in 4 ms. Remains 236 /241 variables (removed 5) and now considering 447/452 (removed 5) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-11 07:53:54] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:53:54] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-11 07:53:54] [INFO ] Invariant cache hit.
[2023-03-11 07:53:55] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-11 07:53:55] [INFO ] Invariant cache hit.
[2023-03-11 07:53:55] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/241 places, 447/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 236/241 places, 447/452 transitions.
Stuttering acceptance computed with spot in 491 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p0 p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(EQ s130 1), p2:(OR (EQ s4 0) (EQ s12 0) (EQ s127 0) (EQ s202 0)), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 10 factoid took 277 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 2388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&G(F(p1))))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 452/452 transitions.
Graph (trivial) has 222 edges and 241 vertex of which 4 / 241 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 238 transition count 363
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 123 rules applied. Total rules applied 210 place count 152 transition count 326
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 232 place count 130 transition count 326
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 232 place count 130 transition count 318
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 248 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 118 transition count 314
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 354 place count 69 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 69 transition count 263
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 366 place count 58 transition count 198
Iterating global reduction 4 with 11 rules applied. Total rules applied 377 place count 58 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 383 place count 58 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 387 place count 56 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 55 transition count 189
Applied a total of 388 rules in 44 ms. Remains 55 /241 variables (removed 186) and now considering 189/452 (removed 263) transitions.
// Phase 1: matrix 189 rows 55 cols
[2023-03-11 07:53:56] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 07:53:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-11 07:53:56] [INFO ] Invariant cache hit.
[2023-03-11 07:53:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:53:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/241 places, 189/452 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 52 transition count 188
Applied a total of 2 rules in 5 ms. Remains 52 /53 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 52 cols
[2023-03-11 07:53:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:53:56] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 07:53:57] [INFO ] Invariant cache hit.
[2023-03-11 07:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:57] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/241 places, 188/452 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 531 ms. Remains : 52/241 places, 188/452 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s42 0), p1:(OR (EQ s2 0) (EQ s3 0) (EQ s29 0) (EQ s48 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25 reset in 46 ms.
Product exploration explored 100000 steps with 46 reset in 39 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2900 steps, including 147 resets, run visited all 2 properties in 20 ms. (steps per millisecond=145 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 52 /52 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-11 07:53:58] [INFO ] Invariant cache hit.
[2023-03-11 07:53:58] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 07:53:58] [INFO ] Invariant cache hit.
[2023-03-11 07:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:58] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-11 07:53:58] [INFO ] Redundant transitions in 31 ms returned [101]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 187 rows 52 cols
[2023-03-11 07:53:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 187/188 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 185
Applied a total of 2 rules in 6 ms. Remains 50 /52 variables (removed 2) and now considering 185/187 (removed 2) transitions.
// Phase 1: matrix 185 rows 50 cols
[2023-03-11 07:53:58] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:53:58] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 07:53:58] [INFO ] Invariant cache hit.
[2023-03-11 07:53:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:53:58] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/52 places, 185/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 661 ms. Remains : 50/52 places, 185/188 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1421 steps, including 60 resets, run visited all 2 properties in 10 ms. (steps per millisecond=142 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 46 reset in 61 ms.
Product exploration explored 100000 steps with 7 reset in 42 ms.
Built C files in :
/tmp/ltsmin3897514271797737555
[2023-03-11 07:54:00] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2023-03-11 07:54:00] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:54:00] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2023-03-11 07:54:00] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:54:00] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2023-03-11 07:54:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:54:00] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3897514271797737555
Running compilation step : cd /tmp/ltsmin3897514271797737555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin3897514271797737555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3897514271797737555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13335212758592039079.hoa' '--buchi-type=spotba'
LTSmin run took 12117 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 16546 ms.
All properties solved by simple procedures.
Total runtime 128839 ms.

BK_STOP 1678521253706

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593400620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;