About the Execution of LTSMin+red for AutonomousCar-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 523.144 | 28039.00 | 56165.00 | 41.00 | FFFFFTTFF?T?TFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598100587.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100587
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678637526400
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:12:09] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-12 16:12:09] [INFO ] Transformed 221 places.
[2023-03-12 16:12:09] [INFO ] Transformed 368 transitions.
[2023-03-12 16:12:09] [INFO ] Found NUPN structural information;
[2023-03-12 16:12:09] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-04b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 198 transition count 345
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 198 transition count 345
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 193 transition count 340
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 193 transition count 340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 192 transition count 339
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 192 transition count 339
Applied a total of 58 rules in 71 ms. Remains 192 /221 variables (removed 29) and now considering 339/368 (removed 29) transitions.
// Phase 1: matrix 339 rows 192 cols
[2023-03-12 16:12:10] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-12 16:12:10] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-12 16:12:10] [INFO ] Invariant cache hit.
[2023-03-12 16:12:11] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-12 16:12:11] [INFO ] Invariant cache hit.
[2023-03-12 16:12:11] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/221 places, 339/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1503 ms. Remains : 192/221 places, 339/368 transitions.
Support contains 33 out of 192 places after structural reductions.
[2023-03-12 16:12:11] [INFO ] Flatten gal took : 138 ms
[2023-03-12 16:12:11] [INFO ] Flatten gal took : 30 ms
[2023-03-12 16:12:12] [INFO ] Input system was already deterministic with 339 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:12:12] [INFO ] Invariant cache hit.
[2023-03-12 16:12:12] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:12:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:12:12] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:12:12] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 4 ms to minimize.
[2023-03-12 16:12:12] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-12 16:12:13] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2023-03-12 16:12:13] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-12 16:12:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 486 ms
[2023-03-12 16:12:13] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 16:12:13] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 178 edges and 192 vertex of which 4 / 192 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 553 edges and 190 vertex of which 186 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 186 transition count 260
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 97 rules applied. Total rules applied 172 place count 115 transition count 234
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 187 place count 100 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 187 place count 100 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 203 place count 92 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 85 transition count 219
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 85 transition count 219
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 281 place count 85 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 85 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 84 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 285 place count 82 transition count 149
Iterating global reduction 4 with 2 rules applied. Total rules applied 287 place count 82 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 289 place count 82 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 290 place count 81 transition count 147
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 358 place count 47 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 359 place count 47 transition count 112
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 366 place count 40 transition count 80
Iterating global reduction 7 with 7 rules applied. Total rules applied 373 place count 40 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 376 place count 40 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 378 place count 39 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 380 place count 38 transition count 89
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 383 place count 38 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 386 place count 35 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 387 place count 35 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 388 place count 34 transition count 85
Applied a total of 388 rules in 53 ms. Remains 34 /192 variables (removed 158) and now considering 85/339 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 34/192 places, 85/339 transitions.
Finished random walk after 119 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Computed a total of 36 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U (p2||G(p1))) U !p0)))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 173 edges and 192 vertex of which 4 / 192 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 189 transition count 267
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 92 rules applied. Total rules applied 162 place count 120 transition count 244
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 177 place count 107 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 179 place count 105 transition count 242
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 179 place count 105 transition count 234
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 195 place count 97 transition count 234
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 202 place count 90 transition count 227
Iterating global reduction 4 with 7 rules applied. Total rules applied 209 place count 90 transition count 227
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 273 place count 90 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 273 place count 90 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 275 place count 89 transition count 162
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 277 place count 87 transition count 157
Iterating global reduction 5 with 2 rules applied. Total rules applied 279 place count 87 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 281 place count 87 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 282 place count 86 transition count 155
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 350 place count 52 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 351 place count 52 transition count 119
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 357 place count 46 transition count 91
Iterating global reduction 8 with 6 rules applied. Total rules applied 363 place count 46 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 364 place count 46 transition count 90
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 9 with 2 rules applied. Total rules applied 366 place count 45 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 368 place count 44 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 370 place count 42 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 371 place count 41 transition count 100
Applied a total of 371 rules in 77 ms. Remains 41 /192 variables (removed 151) and now considering 100/339 (removed 239) transitions.
// Phase 1: matrix 100 rows 41 cols
[2023-03-12 16:12:13] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:12:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 16:12:13] [INFO ] Invariant cache hit.
[2023-03-12 16:12:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:12:13] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [36, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/192 places, 100/339 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 99
Applied a total of 2 rules in 6 ms. Remains 38 /39 variables (removed 1) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 38 cols
[2023-03-12 16:12:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:12:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 16:12:13] [INFO ] Invariant cache hit.
[2023-03-12 16:12:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:12:13] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/192 places, 99/339 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 297 ms. Remains : 38/192 places, 99/339 transitions.
Stuttering acceptance computed with spot in 468 ms :[true, true, (NOT p0), (AND (NOT p2) (NOT p1)), p0]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s7 1)), p2:(AND (NOT (OR (EQ s20 0) (EQ s5 1))) (NEQ s16 1)), p1:(NEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 4 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-01 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 181 transition count 328
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 181 transition count 328
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 86 place count 181 transition count 264
Applied a total of 86 rules in 18 ms. Remains 181 /192 variables (removed 11) and now considering 264/339 (removed 75) transitions.
// Phase 1: matrix 264 rows 181 cols
[2023-03-12 16:12:14] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:12:14] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 16:12:14] [INFO ] Invariant cache hit.
[2023-03-12 16:12:14] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-12 16:12:14] [INFO ] Invariant cache hit.
[2023-03-12 16:12:14] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/192 places, 264/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 181/192 places, 264/339 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s161 1), p1:(AND (EQ s139 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-03 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 176 edges and 192 vertex of which 4 / 192 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 189 transition count 263
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 99 rules applied. Total rules applied 173 place count 116 transition count 237
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 190 place count 101 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 99 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 192 place count 99 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 206 place count 92 transition count 228
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 212 place count 86 transition count 222
Iterating global reduction 4 with 6 rules applied. Total rules applied 218 place count 86 transition count 222
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 282 place count 86 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 282 place count 86 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 284 place count 85 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 84 transition count 156
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 84 transition count 156
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 352 place count 51 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 51 transition count 121
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 358 place count 46 transition count 99
Iterating global reduction 6 with 5 rules applied. Total rules applied 363 place count 46 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 366 place count 46 transition count 96
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 368 place count 45 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 370 place count 44 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 42 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 373 place count 41 transition count 106
Applied a total of 373 rules in 51 ms. Remains 41 /192 variables (removed 151) and now considering 106/339 (removed 233) transitions.
// Phase 1: matrix 106 rows 41 cols
[2023-03-12 16:12:15] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 16:12:15] [INFO ] Invariant cache hit.
[2023-03-12 16:12:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [36, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 192 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/192 places, 106/339 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 38 transition count 105
Applied a total of 2 rules in 19 ms. Remains 38 /39 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 38 cols
[2023-03-12 16:12:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-12 16:12:15] [INFO ] Invariant cache hit.
[2023-03-12 16:12:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/192 places, 105/339 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 433 ms. Remains : 38/192 places, 105/339 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s25 0) (EQ s12 0) (EQ s33 1)), p0:(AND (EQ s24 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-04 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(p1)||G(p2))))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 181 transition count 328
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 181 transition count 328
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 86 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 180 transition count 263
Applied a total of 88 rules in 7 ms. Remains 180 /192 variables (removed 12) and now considering 263/339 (removed 76) transitions.
// Phase 1: matrix 263 rows 180 cols
[2023-03-12 16:12:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 16:12:15] [INFO ] Invariant cache hit.
[2023-03-12 16:12:15] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-12 16:12:15] [INFO ] Invariant cache hit.
[2023-03-12 16:12:15] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/192 places, 263/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 180/192 places, 263/339 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s136 0) (EQ s22 1)), p1:(AND (EQ s22 0) (EQ s136 1)), p2:(OR (EQ s68 0) (EQ s92 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19 reset in 268 ms.
Stack based approach found an accepted trace after 1420 steps with 14 reset with depth 205 and stack size 205 in 18 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-07 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 179 edges and 192 vertex of which 4 / 192 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 189 transition count 265
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 94 rules applied. Total rules applied 166 place count 118 transition count 242
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 180 place count 105 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 104 transition count 241
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 181 place count 104 transition count 232
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 199 place count 95 transition count 232
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 206 place count 88 transition count 225
Iterating global reduction 4 with 7 rules applied. Total rules applied 213 place count 88 transition count 225
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 277 place count 88 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 277 place count 88 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 279 place count 87 transition count 160
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 281 place count 85 transition count 155
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 85 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 285 place count 85 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 286 place count 84 transition count 153
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 356 place count 49 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 49 transition count 116
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 364 place count 42 transition count 84
Iterating global reduction 8 with 7 rules applied. Total rules applied 371 place count 42 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 374 place count 42 transition count 81
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 9 with 2 rules applied. Total rules applied 376 place count 41 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 378 place count 40 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 380 place count 38 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 381 place count 37 transition count 91
Applied a total of 381 rules in 21 ms. Remains 37 /192 variables (removed 155) and now considering 91/339 (removed 248) transitions.
// Phase 1: matrix 91 rows 37 cols
[2023-03-12 16:12:16] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:12:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 16:12:16] [INFO ] Invariant cache hit.
[2023-03-12 16:12:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 16:12:16] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 199 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/192 places, 91/339 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 34 transition count 90
Applied a total of 2 rules in 3 ms. Remains 34 /35 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 34 cols
[2023-03-12 16:12:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:12:16] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 16:12:16] [INFO ] Invariant cache hit.
[2023-03-12 16:12:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 16:12:16] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/192 places, 90/339 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 34/192 places, 90/339 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-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)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s22 1)), p1:(OR (EQ s20 0) (EQ s22 1))], 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 9 reset in 100 ms.
Product exploration explored 100000 steps with 21 reset in 89 ms.
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 (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 305 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 701 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:12:17] [INFO ] Invariant cache hit.
[2023-03-12 16:12:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-12 16:12:18] [INFO ] Invariant cache hit.
[2023-03-12 16:12:18] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-12 16:12:18] [INFO ] Invariant cache hit.
[2023-03-12 16:12:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 16:12:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-12 16:12:18] [INFO ] Redundant transitions in 12 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 89 rows 34 cols
[2023-03-12 16:12:18] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 16:12:18] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 89/90 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 32 transition count 87
Applied a total of 2 rules in 12 ms. Remains 32 /34 variables (removed 2) and now considering 87/89 (removed 2) transitions.
// Phase 1: matrix 87 rows 32 cols
[2023-03-12 16:12:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 16:12:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 16:12:18] [INFO ] Invariant cache hit.
[2023-03-12 16:12:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 16:12:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/34 places, 87/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 32/34 places, 87/90 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18 reset in 165 ms.
Product exploration explored 100000 steps with 255 reset in 144 ms.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-12 16:12:19] [INFO ] Invariant cache hit.
[2023-03-12 16:12:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 16:12:19] [INFO ] Invariant cache hit.
[2023-03-12 16:12:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 16:12:19] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-12 16:12:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 16:12:19] [INFO ] Invariant cache hit.
[2023-03-12 16:12:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 32/32 places, 87/87 transitions.
Treatment of property AutonomousCar-PT-04b-LTLCardinality-09 finished in 3513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((F(!p1) U p2))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Graph (trivial) has 171 edges and 192 vertex of which 4 / 192 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 189 transition count 270
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 85 rules applied. Total rules applied 152 place count 123 transition count 251
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 165 place count 112 transition count 249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 110 transition count 249
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 167 place count 110 transition count 241
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 183 place count 102 transition count 241
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 190 place count 95 transition count 234
Iterating global reduction 4 with 7 rules applied. Total rules applied 197 place count 95 transition count 234
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 261 place count 95 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 95 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 94 transition count 169
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 93 transition count 165
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 93 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 267 place count 93 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 268 place count 92 transition count 163
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 336 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 337 place count 58 transition count 128
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 344 place count 51 transition count 96
Iterating global reduction 8 with 7 rules applied. Total rules applied 351 place count 51 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 354 place count 51 transition count 93
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 9 with 2 rules applied. Total rules applied 356 place count 50 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 360 place count 48 transition count 106
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 362 place count 48 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 364 place count 46 transition count 104
Applied a total of 364 rules in 23 ms. Remains 46 /192 variables (removed 146) and now considering 104/339 (removed 235) transitions.
// Phase 1: matrix 104 rows 46 cols
[2023-03-12 16:12:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:12:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 16:12:20] [INFO ] Invariant cache hit.
[2023-03-12 16:12:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 16:12:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/192 places, 104/339 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 44 transition count 105
Applied a total of 2 rules in 3 ms. Remains 44 /45 variables (removed 1) and now considering 105/104 (removed -1) transitions.
// Phase 1: matrix 105 rows 44 cols
[2023-03-12 16:12:20] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:12:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 16:12:20] [INFO ] Invariant cache hit.
[2023-03-12 16:12:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 16:12:20] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/192 places, 105/339 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 315 ms. Remains : 44/192 places, 105/339 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 1}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s2 1)), p2:(OR (EQ s39 0) (EQ s9 1)), p1:(OR (EQ s30 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 23 reset in 100 ms.
Product exploration explored 100000 steps with 1 reset in 145 ms.
Computed a total of 5 stabilizing places and 8 stable transitions
Computed a total of 5 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p2), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1777 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 514 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 630 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:12:23] [INFO ] Invariant cache hit.
[2023-03-12 16:12:23] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:12:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 40 ms returned sat
[2023-03-12 16:12:23] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X p2), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p2 p1 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2))), (F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p2 p1)), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 25 factoid took 1756 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-12 16:12:26] [INFO ] Invariant cache hit.
[2023-03-12 16:12:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 16:12:26] [INFO ] Invariant cache hit.
[2023-03-12 16:12:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 16:12:26] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-12 16:12:26] [INFO ] Invariant cache hit.
[2023-03-12 16:12:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 44/44 places, 105/105 transitions.
Computed a total of 5 stabilizing places and 8 stable transitions
Computed a total of 5 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p1 (NOT p2)))), true, (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 809 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 173 steps, including 6 resets, run visited all 7 properties in 45 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p1 (NOT p2)))), true, (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 1207 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 489 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 425 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 101 ms.
Product exploration explored 100000 steps with 38 reset in 148 ms.
Applying partial POR strategy [false, true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 406 ms :[(NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-12 16:12:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 44/44 places, 105/105 transitions.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 16:12:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 44/44 places, 105/105 transitions.
Treatment of property AutonomousCar-PT-04b-LTLCardinality-11 finished in 11630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||(p0 U p2))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 330
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 330
Applied a total of 18 rules in 4 ms. Remains 183 /192 variables (removed 9) and now considering 330/339 (removed 9) transitions.
// Phase 1: matrix 330 rows 183 cols
[2023-03-12 16:12:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:12:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-12 16:12:31] [INFO ] Invariant cache hit.
[2023-03-12 16:12:31] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/192 places, 330/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 183/192 places, 330/339 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s97 0) (EQ s3 1)), p2:(OR (EQ s11 0) (EQ s140 1)), p0:(OR (EQ s168 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Computed a total of 34 stabilizing places and 35 stable transitions
Computed a total of 34 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 18 factoid took 267 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLCardinality-12 finished in 1515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 339/339 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 181 transition count 328
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 181 transition count 328
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 86 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 180 transition count 263
Applied a total of 88 rules in 12 ms. Remains 180 /192 variables (removed 12) and now considering 263/339 (removed 76) transitions.
// Phase 1: matrix 263 rows 180 cols
[2023-03-12 16:12:33] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:12:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 16:12:33] [INFO ] Invariant cache hit.
[2023-03-12 16:12:33] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-12 16:12:33] [INFO ] Invariant cache hit.
[2023-03-12 16:12:33] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/192 places, 263/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 180/192 places, 263/339 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLCardinality-13 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:(OR (EQ s100 0) (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][false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLCardinality-13 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((F(!p1) U p2))))'
[2023-03-12 16:12:33] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:12:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 16:12:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 339 transitions and 1600 arcs took 3 ms.
Total runtime 24275 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1517/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1517/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-04b-LTLCardinality-09
Could not compute solution for formula : AutonomousCar-PT-04b-LTLCardinality-11
BK_STOP 1678637554439
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-04b-LTLCardinality-09
ltl formula formula --ltl=/tmp/1517/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 192 places, 339 transitions and 1600 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1517/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1517/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1517/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1517/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-04b-LTLCardinality-11
ltl formula formula --ltl=/tmp/1517/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 192 places, 339 transitions and 1600 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1517/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1517/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1517/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1517/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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-04b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;