Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 228K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-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 1716307829066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 16:10:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 16:10:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:10:31] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-21 16:10:31] [INFO ] Transformed 289 places.
[2024-05-21 16:10:32] [INFO ] Transformed 644 transitions.
[2024-05-21 16:10:32] [INFO ] Found NUPN structural information;
[2024-05-21 16:10:32] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 248 transition count 603
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 248 transition count 603
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 226 place count 248 transition count 459
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 234 place count 240 transition count 451
Iterating global reduction 1 with 8 rules applied. Total rules applied 242 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 239 transition count 450
Applied a total of 244 rules in 128 ms. Remains 239 /289 variables (removed 50) and now considering 450/644 (removed 194) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-21 16:10:32] [INFO ] Computed 11 invariants in 29 ms
[2024-05-21 16:10:32] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 16:10:32] [INFO ] Invariant cache hit.
[2024-05-21 16:10:33] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2024-05-21 16:10:33] [INFO ] Invariant cache hit.
[2024-05-21 16:10:33] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/289 places, 450/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1393 ms. Remains : 239/289 places, 450/644 transitions.
Support contains 41 out of 239 places after structural reductions.
[2024-05-21 16:10:33] [INFO ] Flatten gal took : 107 ms
[2024-05-21 16:10:34] [INFO ] Flatten gal took : 65 ms
[2024-05-21 16:10:34] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 40 out of 239 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 26) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-21 16:10:35] [INFO ] Invariant cache hit.
[2024-05-21 16:10:35] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-21 16:10:35] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2024-05-21 16:10:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-21 16:10:36] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-21 16:10:37] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 8 ms to minimize.
[2024-05-21 16:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-05-21 16:10:37] [INFO ] After 1579ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 437 ms.
[2024-05-21 16:10:37] [INFO ] After 2252ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 27 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 186 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 874 edges and 237 vertex of which 235 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 235 transition count 365
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 113 rules applied. Total rules applied 196 place count 156 transition count 331
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 217 place count 136 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 135 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 134 transition count 328
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 221 place count 134 transition count 323
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 231 place count 129 transition count 323
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 234 place count 126 transition count 320
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 126 transition count 320
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 315 place count 87 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 316 place count 87 transition count 280
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 319 place count 84 transition count 267
Iterating global reduction 6 with 3 rules applied. Total rules applied 322 place count 84 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 324 place count 84 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 83 transition count 264
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 342 place count 83 transition count 248
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 358 place count 67 transition count 248
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 364 place count 67 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 66 transition count 247
Applied a total of 365 rules in 141 ms. Remains 66 /239 variables (removed 173) and now considering 247/450 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 66/239 places, 247/450 transitions.
Incomplete random walk after 10000 steps, including 308 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 247 rows 66 cols
[2024-05-21 16:10:38] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:10:38] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:10:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:38] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:38] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 16:10:38] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-21 16:10:39] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 247/247 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 64 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 64 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 63 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 62 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 62 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 62 transition count 237
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 17 place count 58 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 58 transition count 232
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 26 place count 54 transition count 228
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 54 transition count 224
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 52 place count 50 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 49 transition count 205
Applied a total of 53 rules in 51 ms. Remains 49 /66 variables (removed 17) and now considering 205/247 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 49/66 places, 205/247 transitions.
Finished random walk after 8072 steps, including 60 resets, run visited all 2 properties in 92 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 40 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U (p1||F((G(F(!p2))||(!p3&&F(!p2)))))))))'
Support contains 12 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 14 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 16:10:39] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:39] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 16:10:39] [INFO ] Invariant cache hit.
[2024-05-21 16:10:39] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-21 16:10:39] [INFO ] Invariant cache hit.
[2024-05-21 16:10:40] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 235/239 places, 446/450 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 524 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0), p2]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 7}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p0), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s6 1) (EQ s36 1) (EQ s201 1)), p3:(AND (EQ s4 1) (EQ s6 1) (EQ s161 1) (EQ s201 1)), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s36 1) (EQ s201...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 482 ms.
Product exploration explored 100000 steps with 33333 reset in 387 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) (NOT p3) (NOT p0) (NOT p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 2277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 236 transition count 362
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 118 rules applied. Total rules applied 204 place count 151 transition count 329
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 224 place count 132 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 131 transition count 328
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 225 place count 131 transition count 320
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 241 place count 123 transition count 320
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 119 transition count 316
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 119 transition count 316
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 355 place count 66 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 66 transition count 261
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 369 place count 53 transition count 182
Iterating global reduction 5 with 13 rules applied. Total rules applied 382 place count 53 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 388 place count 53 transition count 176
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 392 place count 51 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 49 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 395 place count 48 transition count 172
Applied a total of 395 rules in 71 ms. Remains 48 /239 variables (removed 191) and now considering 172/450 (removed 278) transitions.
// Phase 1: matrix 172 rows 48 cols
[2024-05-21 16:10:41] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:10:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 16:10:41] [INFO ] Invariant cache hit.
[2024-05-21 16:10:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [43, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 221 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/239 places, 172/450 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 171
Applied a total of 2 rules in 11 ms. Remains 45 /46 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 45 cols
[2024-05-21 16:10:42] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 16:10:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 16:10:42] [INFO ] Invariant cache hit.
[2024-05-21 16:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:42] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/239 places, 171/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 537 ms. Remains : 45/239 places, 171/450 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Product exploration explored 100000 steps with 113 reset in 113 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 171/171 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-21 16:10:43] [INFO ] Invariant cache hit.
[2024-05-21 16:10:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 16:10:43] [INFO ] Invariant cache hit.
[2024-05-21 16:10:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:43] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-21 16:10:43] [INFO ] Redundant transitions in 20 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 170 rows 45 cols
[2024-05-21 16:10:43] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 16:10:43] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 170/171 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 43 transition count 168
Applied a total of 2 rules in 9 ms. Remains 43 /45 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 43 cols
[2024-05-21 16:10:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 16:10:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 16:10:43] [INFO ] Invariant cache hit.
[2024-05-21 16:10:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:44] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/45 places, 168/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 916 ms. Remains : 43/45 places, 168/171 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 30 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 67 reset in 104 ms.
Product exploration explored 100000 steps with 14 reset in 113 ms.
Built C files in :
/tmp/ltsmin14500737505130345440
[2024-05-21 16:10:44] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-21 16:10:44] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:44] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-21 16:10:44] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:44] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-21 16:10:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:44] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14500737505130345440
Running compilation step : cd /tmp/ltsmin14500737505130345440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 862 ms.
Running link step : cd /tmp/ltsmin14500737505130345440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14500737505130345440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16008869864459184196.hoa' '--buchi-type=spotba'
LTSmin run took 217 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 4155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1 U G(!p1)))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 10 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 16:10:45] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 16:10:46] [INFO ] Invariant cache hit.
[2024-05-21 16:10:46] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-21 16:10:46] [INFO ] Invariant cache hit.
[2024-05-21 16:10:46] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/239 places, 447/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 236/239 places, 447/450 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s4 1) (EQ s12 1) (EQ s171 1) (EQ s202 1)), p0:(EQ s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-03 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 236 transition count 360
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 232 place count 128 transition count 318
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 244 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 118 transition count 314
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 356 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 357 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 369 place count 54 transition count 187
Iterating global reduction 4 with 12 rules applied. Total rules applied 381 place count 54 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 386 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 390 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 392 place count 50 transition count 178
Applied a total of 392 rules in 86 ms. Remains 50 /239 variables (removed 189) and now considering 178/450 (removed 272) transitions.
// Phase 1: matrix 178 rows 50 cols
[2024-05-21 16:10:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 16:10:47] [INFO ] Invariant cache hit.
[2024-05-21 16:10:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 227 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/239 places, 178/450 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 47 transition count 177
Applied a total of 2 rules in 9 ms. Remains 47 /48 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 47 cols
[2024-05-21 16:10:47] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:10:47] [INFO ] Invariant cache hit.
[2024-05-21 16:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/239 places, 177/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 47/239 places, 177/450 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04 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 s1 1) (EQ s6 1) (EQ s14 1) (EQ s43 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 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1 U p2)))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 6 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 16:10:47] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 16:10:47] [INFO ] Invariant cache hit.
[2024-05-21 16:10:47] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-21 16:10:47] [INFO ] Invariant cache hit.
[2024-05-21 16:10:48] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(AND (EQ s4 1) (EQ s6 1) (EQ s151 1) (EQ s201 1)), p1:(AND (EQ s4 1) (EQ s15 1) (EQ s136 1) (EQ s201 1)), p0:(OR (EQ s4 0) (EQ s15 0) (EQ s136 0) (EQ s...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 119 ms.
Entered a terminal (fully accepting) state of product in 7412 steps with 73 reset in 22 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 1072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 7 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
[2024-05-21 16:10:48] [INFO ] Invariant cache hit.
[2024-05-21 16:10:48] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 16:10:48] [INFO ] Invariant cache hit.
[2024-05-21 16:10:48] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-21 16:10:48] [INFO ] Invariant cache hit.
[2024-05-21 16:10:49] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s191 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-08 finished in 827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||G(p2))))'
Support contains 13 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 208 edges and 239 vertex of which 4 / 239 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 236 transition count 360
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 232 place count 128 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 244 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 118 transition count 314
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 340 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 341 place count 74 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 348 place count 67 transition count 230
Iterating global reduction 4 with 7 rules applied. Total rules applied 355 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 360 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 364 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 365 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 366 place count 64 transition count 222
Applied a total of 366 rules in 38 ms. Remains 64 /239 variables (removed 175) and now considering 222/450 (removed 228) transitions.
// Phase 1: matrix 222 rows 64 cols
[2024-05-21 16:10:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 16:10:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 16:10:49] [INFO ] Invariant cache hit.
[2024-05-21 16:10:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:49] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 198 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/239 places, 222/450 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 7 ms. Remains 61 /62 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 61 cols
[2024-05-21 16:10:49] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:10:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 16:10:49] [INFO ] Invariant cache hit.
[2024-05-21 16:10:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:49] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/239 places, 221/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 61/239 places, 221/450 transitions.
Stuttering acceptance computed with spot in 75 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 177 reset in 241 ms.
Product exploration explored 100000 steps with 16 reset in 305 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 (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT 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 p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 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 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 409 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 16:10:51] [INFO ] Invariant cache hit.
[2024-05-21 16:10:51] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:10:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 16:10:51] [INFO ] After 40ms 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 (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT 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 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 (Minato strategy)
Knowledge based reduction with 13 factoid took 21 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 2010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 236 transition count 359
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 124 rules applied. Total rules applied 213 place count 148 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 234 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 234 place count 127 transition count 317
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 246 place count 121 transition count 317
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 250 place count 117 transition count 313
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 117 transition count 313
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 358 place count 65 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 359 place count 65 transition count 259
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 371 place count 53 transition count 187
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 53 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 53 transition count 181
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 393 place count 51 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 395 place count 49 transition count 177
Applied a total of 395 rules in 41 ms. Remains 49 /239 variables (removed 190) and now considering 177/450 (removed 273) transitions.
// Phase 1: matrix 177 rows 49 cols
[2024-05-21 16:10:51] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 16:10:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 16:10:51] [INFO ] Invariant cache hit.
[2024-05-21 16:10:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:51] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [44, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 209 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/239 places, 177/450 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 46 transition count 176
Applied a total of 2 rules in 8 ms. Remains 46 /47 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 46 cols
[2024-05-21 16:10:51] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:10:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 16:10:51] [INFO ] Invariant cache hit.
[2024-05-21 16:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:51] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/239 places, 176/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 453 ms. Remains : 46/239 places, 176/450 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s15 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 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 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 8 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 6 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 16:10:51] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:10:52] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 16:10:52] [INFO ] Invariant cache hit.
[2024-05-21 16:10:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-21 16:10:52] [INFO ] Invariant cache hit.
[2024-05-21 16:10:52] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/239 places, 447/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 236/239 places, 447/450 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11 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:(EQ s212 0), p0:(AND (EQ s50 1) (EQ s75 1) (EQ s105 1) (EQ s125 1) (EQ s155 1) (EQ s180 1) (EQ s202 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 318 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 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 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-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 1551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(((X(!p1)&&F(p2))||G(!p1)))))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 6 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 16:10:53] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:10:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 16:10:53] [INFO ] Invariant cache hit.
[2024-05-21 16:10:53] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-21 16:10:53] [INFO ] Invariant cache hit.
[2024-05-21 16:10:54] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/239 places, 447/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 236/239 places, 447/450 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s200 1), p1:(AND (EQ s4 1) (EQ s13 1) (EQ s51 1) (EQ s202 1)), p2:(NEQ s98 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 226 edges and 239 vertex of which 4 / 239 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 236 transition count 361
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 122 rules applied. Total rules applied 209 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 231 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 232 place count 128 transition count 316
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 248 place count 120 transition count 316
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 252 place count 116 transition count 312
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 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 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 356 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 66 transition count 260
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 370 place count 53 transition count 181
Iterating global reduction 5 with 13 rules applied. Total rules applied 383 place count 53 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 389 place count 53 transition count 175
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 6 with 4 rules applied. Total rules applied 393 place count 51 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 395 place count 49 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 396 place count 48 transition count 171
Applied a total of 396 rules in 38 ms. Remains 48 /239 variables (removed 191) and now considering 171/450 (removed 279) transitions.
// Phase 1: matrix 171 rows 48 cols
[2024-05-21 16:10:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 16:10:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 16:10:54] [INFO ] Invariant cache hit.
[2024-05-21 16:10:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:54] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 206 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/239 places, 171/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 47/239 places, 171/450 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-13 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:(EQ s42 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 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-13 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 6 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 16:10:54] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 16:10:54] [INFO ] Invariant cache hit.
[2024-05-21 16:10:55] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-21 16:10:55] [INFO ] Invariant cache hit.
[2024-05-21 16:10:55] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&G(F(p1))))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 220 edges and 239 vertex of which 4 / 239 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 236 transition count 361
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 122 rules applied. Total rules applied 209 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 230 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 230 place count 129 transition count 318
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 244 place count 122 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 119 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 119 transition count 315
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 350 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 351 place count 69 transition count 263
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 362 place count 58 transition count 198
Iterating global reduction 4 with 11 rules applied. Total rules applied 373 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 379 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 383 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 384 place count 55 transition count 189
Applied a total of 384 rules in 36 ms. Remains 55 /239 variables (removed 184) and now considering 189/450 (removed 261) transitions.
// Phase 1: matrix 189 rows 55 cols
[2024-05-21 16:10:55] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 16:10:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 16:10:55] [INFO ] Invariant cache hit.
[2024-05-21 16:10:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:55] [INFO ] Implicit Places using invariants and state equation in 132 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/239 places, 189/450 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 7 ms. Remains 52 /53 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 52 cols
[2024-05-21 16:10:55] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:10:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 16:10:55] [INFO ] Invariant cache hit.
[2024-05-21 16:10:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:55] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/239 places, 188/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 457 ms. Remains : 52/239 places, 188/450 transitions.
Stuttering acceptance computed with spot in 69 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 65 reset in 57 ms.
Product exploration explored 100000 steps with 17 reset in 61 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3186 steps, including 160 resets, run visited all 2 properties in 12 ms. (steps per millisecond=265 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 138 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 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 5 ms. Remains 52 /52 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 16:10:56] [INFO ] Invariant cache hit.
[2024-05-21 16:10:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 16:10:56] [INFO ] Invariant cache hit.
[2024-05-21 16:10:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:56] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-21 16:10:56] [INFO ] Redundant transitions in 20 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
[2024-05-21 16:10:56] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:10:57] [INFO ] Dead Transitions using invariants and state equation in 122 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 7 ms. Remains 50 /52 variables (removed 2) and now considering 185/187 (removed 2) transitions.
// Phase 1: matrix 185 rows 50 cols
[2024-05-21 16:10:57] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:10:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:10:57] [INFO ] Invariant cache hit.
[2024-05-21 16:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 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 572 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 361 steps, including 14 resets, run visited all 2 properties in 4 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 135 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 55 reset in 55 ms.
Product exploration explored 100000 steps with 109 reset in 64 ms.
Built C files in :
/tmp/ltsmin8546740850130335056
[2024-05-21 16:10:57] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 16:10:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:57] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 16:10:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:57] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 16:10:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:57] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8546740850130335056
Running compilation step : cd /tmp/ltsmin8546740850130335056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin8546740850130335056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8546740850130335056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7466924007789681034.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 185/185 transitions.
Applied a total of 0 rules in 13 ms. Remains 50 /50 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-21 16:11:13] [INFO ] Invariant cache hit.
[2024-05-21 16:11:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 16:11:13] [INFO ] Invariant cache hit.
[2024-05-21 16:11:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:11:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-21 16:11:13] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-21 16:11:13] [INFO ] Invariant cache hit.
[2024-05-21 16:11:13] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 50/50 places, 185/185 transitions.
Built C files in :
/tmp/ltsmin3571841181555666710
[2024-05-21 16:11:13] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 16:11:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:11:13] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 16:11:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:11:13] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 16:11:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:11:13] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3571841181555666710
Running compilation step : cd /tmp/ltsmin3571841181555666710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin3571841181555666710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3571841181555666710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9933556604455835986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:11:28] [INFO ] Flatten gal took : 40 ms
[2024-05-21 16:11:28] [INFO ] Flatten gal took : 34 ms
[2024-05-21 16:11:28] [INFO ] Time to serialize gal into /tmp/LTL17440818112493773918.gal : 5 ms
[2024-05-21 16:11:28] [INFO ] Time to serialize properties into /tmp/LTL15445449926974885012.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17440818112493773918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17105304583303553449.hoa' '-atoms' '/tmp/LTL15445449926974885012.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15445449926974885012.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17105304583303553449.hoa
Reverse transition relation is NOT exact ! Due to transitions t66, t69, t71, t73, t93, t97, t120, t124, t146, t151, t173, t177, t198, t202, t53.t381, t53.t...2516
Computing Next relation with stutter on 10795 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:11:43] [INFO ] Flatten gal took : 29 ms
[2024-05-21 16:11:43] [INFO ] Flatten gal took : 23 ms
[2024-05-21 16:11:43] [INFO ] Time to serialize gal into /tmp/LTL17043447086271235457.gal : 4 ms
[2024-05-21 16:11:43] [INFO ] Time to serialize properties into /tmp/LTL12091444194900343539.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17043447086271235457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12091444194900343539.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(p212==0)"))||((G(F("(((p6==0)||(p9==0))||((p151==0)||(p246==0)))")))&&("(((p6==0)||(p9==0))||((p151==0)||(p246==0)))")))))
Formula 0 simplified : G(F!"(p212==0)" & (!"(((p6==0)||(p9==0))||((p151==0)||(p246==0)))" | FG!"(((p6==0)||(p9==0))||((p151==0)||(p246==0)))"))
Reverse transition relation is NOT exact ! Due to transitions t66, t69, t71, t73, t93, t97, t120, t124, t146, t151, t173, t177, t198, t202, t53.t381, t53.t...2516
Computing Next relation with stutter on 10795 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:11:58] [INFO ] Flatten gal took : 20 ms
[2024-05-21 16:11:58] [INFO ] Applying decomposition
[2024-05-21 16:11:58] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph259876797640546055.txt' '-o' '/tmp/graph259876797640546055.bin' '-w' '/tmp/graph259876797640546055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph259876797640546055.bin' '-l' '-1' '-v' '-w' '/tmp/graph259876797640546055.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:11:59] [INFO ] Decomposing Gal with order
[2024-05-21 16:11:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:11:59] [INFO ] Removed a total of 686 redundant transitions.
[2024-05-21 16:11:59] [INFO ] Flatten gal took : 91 ms
[2024-05-21 16:11:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 13 ms.
[2024-05-21 16:11:59] [INFO ] Time to serialize gal into /tmp/LTL3437073396347617180.gal : 2 ms
[2024-05-21 16:11:59] [INFO ] Time to serialize properties into /tmp/LTL13145806570136236975.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3437073396347617180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13145806570136236975.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(i2.u13.p212==0)"))||((G(F("(((i8.u0.p6==0)||(i8.u1.p9==0))||((u8.p151==0)||(i8.u15.p246==0)))")))&&("(((i8.u0.p6==0)||(i8.u1...204
Formula 0 simplified : G(F!"(i2.u13.p212==0)" & (!"(((i8.u0.p6==0)||(i8.u1.p9==0))||((u8.p151==0)||(i8.u15.p246==0)))" | FG!"(((i8.u0.p6==0)||(i8.u1.p9==0)...194
Reverse transition relation is NOT exact ! Due to transitions t53_t399, t318_t216_t217_t40_t41_t37_t38, t323_t216_t217_t40_t41_t37_t38, t294_t191_t192_t40_...856
Computing Next relation with stutter on 10795 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
15 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,0.170411,19804,1,0,7533,906,868,13514,316,3587,14111
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-06b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 63840 ms.
All properties solved by simple procedures.
Total runtime 87685 ms.

BK_STOP 1716307920450

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-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 r043-smll-171620180300193"
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 ;