Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678520733648

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:45:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:45:38] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-11 07:45:38] [INFO ] Transformed 221 places.
[2023-03-11 07:45:38] [INFO ] Transformed 368 transitions.
[2023-03-11 07:45:38] [INFO ] Found NUPN structural information;
[2023-03-11 07:45:38] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 192 transition count 339
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 192 transition count 339
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 122 place count 192 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 186 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 186 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 185 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 185 transition count 268
Applied a total of 136 rules in 57 ms. Remains 185 /221 variables (removed 36) and now considering 268/368 (removed 100) transitions.
// Phase 1: matrix 268 rows 185 cols
[2023-03-11 07:45:38] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-11 07:45:39] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-11 07:45:39] [INFO ] Invariant cache hit.
[2023-03-11 07:45:39] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-11 07:45:39] [INFO ] Invariant cache hit.
[2023-03-11 07:45:39] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/221 places, 268/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 185/221 places, 268/368 transitions.
Support contains 25 out of 185 places after structural reductions.
[2023-03-11 07:45:41] [INFO ] Flatten gal took : 1897 ms
[2023-03-11 07:45:41] [INFO ] Flatten gal took : 38 ms
[2023-03-11 07:45:41] [INFO ] Input system was already deterministic with 268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 07:45:42] [INFO ] Invariant cache hit.
[2023-03-11 07:45:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 07:45:42] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:45:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 07:45:42] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:45:42] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 4 ms to minimize.
[2023-03-11 07:45:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-11 07:45:42] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 07:45:42] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 173 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 524 edges and 183 vertex of which 181 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 181 transition count 191
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 100 rules applied. Total rules applied 175 place count 110 transition count 162
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 192 place count 93 transition count 162
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 192 place count 93 transition count 156
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 87 transition count 156
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 84 transition count 153
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 84 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 211 place count 83 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 83 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 3 with 2 rules applied. Total rules applied 214 place count 83 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 215 place count 82 transition count 147
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 287 place count 46 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 46 transition count 110
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 295 place count 39 transition count 81
Iterating global reduction 6 with 7 rules applied. Total rules applied 302 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 304 place count 39 transition count 79
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 306 place count 38 transition count 78
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 308 place count 37 transition count 91
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 312 place count 37 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 316 place count 33 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 317 place count 33 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 318 place count 32 transition count 86
Applied a total of 318 rules in 48 ms. Remains 32 /185 variables (removed 153) and now considering 86/268 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 32/185 places, 86/268 transitions.
Finished random walk after 590 steps, including 31 resets, run visited all 1 properties in 3 ms. (steps per millisecond=196 )
FORMULA AutonomousCar-PT-04b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 36 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(G(p0)) U !p0))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 173 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 182 transition count 196
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 96 rules applied. Total rules applied 166 place count 113 transition count 169
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 182 place count 97 transition count 169
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 182 place count 97 transition count 162
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 196 place count 90 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 86 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 86 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 85 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 85 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 85 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 84 transition count 152
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 281 place count 48 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 48 transition count 114
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 289 place count 41 transition count 86
Iterating global reduction 6 with 7 rules applied. Total rules applied 296 place count 41 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 299 place count 41 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 303 place count 39 transition count 81
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 305 place count 38 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 36 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 308 place count 35 transition count 92
Applied a total of 308 rules in 63 ms. Remains 35 /185 variables (removed 150) and now considering 92/268 (removed 176) transitions.
// Phase 1: matrix 92 rows 35 cols
[2023-03-11 07:45:43] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:45:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:45:43] [INFO ] Invariant cache hit.
[2023-03-11 07:45:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:45:43] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [30, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/185 places, 92/268 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 91
Applied a total of 2 rules in 9 ms. Remains 32 /33 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 32 cols
[2023-03-11 07:45:43] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 07:45:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 07:45:43] [INFO ] Invariant cache hit.
[2023-03-11 07:45:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:43] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/185 places, 91/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 32/185 places, 91/268 transitions.
Stuttering acceptance computed with spot in 293 ms :[p0, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s12 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 2 reset in 223 ms.
Product exploration explored 100000 steps with 29 reset in 86 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, (NOT p0)]
Finished random walk after 15 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[p0, (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[p0, (NOT p0)]
[2023-03-11 07:45:44] [INFO ] Invariant cache hit.
[2023-03-11 07:45:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:45:44] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-11 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:45:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 07:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:45:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-11 07:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-11 07:45:45] [INFO ] Computed and/alt/rep : 14/43/14 causal constraints (skipped 73 transitions) in 15 ms.
[2023-03-11 07:45:45] [INFO ] Added : 1 causal constraints over 1 iterations in 86 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-11 07:45:45] [INFO ] Invariant cache hit.
[2023-03-11 07:45:45] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 07:45:45] [INFO ] Invariant cache hit.
[2023-03-11 07:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-11 07:45:45] [INFO ] Redundant transitions in 21 ms returned [28]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 90 rows 32 cols
[2023-03-11 07:45:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 07:45:45] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/32 places, 90/91 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 30 transition count 88
Applied a total of 2 rules in 6 ms. Remains 30 /32 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 30 cols
[2023-03-11 07:45:45] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-11 07:45:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 07:45:45] [INFO ] Invariant cache hit.
[2023-03-11 07:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/32 places, 88/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 543 ms. Remains : 30/32 places, 88/91 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, (NOT p0)]
Finished random walk after 19 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[p0, (NOT p0)]
[2023-03-11 07:45:46] [INFO ] Invariant cache hit.
[2023-03-11 07:45:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 07:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:45:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-11 07:45:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:45:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-11 07:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:45:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-11 07:45:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 07:45:46] [INFO ] Computed and/alt/rep : 10/39/10 causal constraints (skipped 75 transitions) in 23 ms.
[2023-03-11 07:45:46] [INFO ] Added : 1 causal constraints over 1 iterations in 37 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 102 ms :[p0, (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 102 ms.
Stuttering criterion allowed to conclude after 81 steps with 6 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-00 finished in 3983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((F(p1)&&F(G(p2)))))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 182 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 264
Applied a total of 8 rules in 23 ms. Remains 181 /185 variables (removed 4) and now considering 264/268 (removed 4) transitions.
// Phase 1: matrix 264 rows 181 cols
[2023-03-11 07:45:47] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:45:47] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 07:45:47] [INFO ] Invariant cache hit.
[2023-03-11 07:45:47] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-11 07:45:47] [INFO ] Invariant cache hit.
[2023-03-11 07:45:47] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/185 places, 264/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 181/185 places, 264/268 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s131 0), p1:(EQ s43 0), p2:(EQ s39 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLFireability-01 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 173 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 182 transition count 195
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 97 rules applied. Total rules applied 168 place count 112 transition count 168
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 184 place count 96 transition count 168
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 184 place count 96 transition count 162
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 196 place count 90 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 86 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 86 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 85 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 85 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 85 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 84 transition count 152
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 5 with 70 rules applied. Total rules applied 279 place count 49 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 280 place count 49 transition count 115
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 287 place count 42 transition count 86
Iterating global reduction 6 with 7 rules applied. Total rules applied 294 place count 42 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 296 place count 42 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 300 place count 40 transition count 82
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 302 place count 39 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 39 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 305 place count 37 transition count 93
Applied a total of 305 rules in 52 ms. Remains 37 /185 variables (removed 148) and now considering 93/268 (removed 175) transitions.
// Phase 1: matrix 93 rows 37 cols
[2023-03-11 07:45:48] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-11 07:45:48] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-11 07:45:48] [INFO ] Invariant cache hit.
[2023-03-11 07:45:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:45:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 189 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/185 places, 93/268 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 34 transition count 92
Applied a total of 2 rules in 7 ms. Remains 34 /35 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 34 cols
[2023-03-11 07:45:48] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-11 07:45:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:45:48] [INFO ] Invariant cache hit.
[2023-03-11 07:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:45:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/185 places, 92/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 34/185 places, 92/268 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s12 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-04 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(G(p0))&&F(p1))))&&(p2 U (p3||G(p2)))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 263
Applied a total of 10 rules in 15 ms. Remains 180 /185 variables (removed 5) and now considering 263/268 (removed 5) transitions.
// Phase 1: matrix 263 rows 180 cols
[2023-03-11 07:45:48] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:45:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 07:45:48] [INFO ] Invariant cache hit.
[2023-03-11 07:45:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 07:45:49] [INFO ] Invariant cache hit.
[2023-03-11 07:45:49] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/185 places, 263/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 180/185 places, 263/268 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (NEQ s62 1) (NEQ s26 1)), p2:(NEQ s26 1), p1:(EQ s62 0), p0:(EQ s153 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 140 ms.
Product exploration explored 100000 steps with 5 reset in 182 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Detected a total of 33/180 stabilizing places and 34/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 p1 p0), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p3 p2 p1 p0), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 765 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Support contains 1 out of 180 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 263/263 transitions.
Graph (trivial) has 165 edges and 180 vertex of which 4 / 180 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 177 transition count 199
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 85 rules applied. Total rules applied 147 place count 116 transition count 175
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 163 place count 102 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 165 place count 100 transition count 173
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 165 place count 100 transition count 164
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 183 place count 91 transition count 164
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 184 place count 90 transition count 163
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 90 transition count 163
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 257 place count 54 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 54 transition count 125
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 267 place count 45 transition count 88
Iterating global reduction 5 with 9 rules applied. Total rules applied 276 place count 45 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 279 place count 45 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 283 place count 43 transition count 83
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 6 with 2 rules applied. Total rules applied 285 place count 42 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 287 place count 40 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 288 place count 39 transition count 94
Applied a total of 288 rules in 46 ms. Remains 39 /180 variables (removed 141) and now considering 94/263 (removed 169) transitions.
// Phase 1: matrix 94 rows 39 cols
[2023-03-11 07:45:51] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 07:45:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-11 07:45:51] [INFO ] Invariant cache hit.
[2023-03-11 07:45:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:45:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/180 places, 94/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 38/180 places, 94/263 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/38 stabilizing places and 4/94 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9 reset in 88 ms.
Product exploration explored 100000 steps with 33 reset in 49 ms.
Built C files in :
/tmp/ltsmin8122846831969741420
[2023-03-11 07:45:52] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2023-03-11 07:45:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:45:52] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2023-03-11 07:45:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:45:52] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2023-03-11 07:45:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:45:52] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8122846831969741420
Running compilation step : cd /tmp/ltsmin8122846831969741420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin8122846831969741420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin8122846831969741420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16489996328549259477.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-07 finished in 4615 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 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 263
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 262
Applied a total of 12 rules in 9 ms. Remains 179 /185 variables (removed 6) and now considering 262/268 (removed 6) transitions.
// Phase 1: matrix 262 rows 179 cols
[2023-03-11 07:45:53] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:45:53] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 07:45:53] [INFO ] Invariant cache hit.
[2023-03-11 07:45:53] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-11 07:45:53] [INFO ] Invariant cache hit.
[2023-03-11 07:45:53] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 262/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 179/185 places, 262/268 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s75 0)], 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 34 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-09 finished in 583 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 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 263
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 262
Applied a total of 12 rules in 8 ms. Remains 179 /185 variables (removed 6) and now considering 262/268 (removed 6) transitions.
[2023-03-11 07:45:54] [INFO ] Invariant cache hit.
[2023-03-11 07:45:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 07:45:54] [INFO ] Invariant cache hit.
[2023-03-11 07:45:54] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-11 07:45:54] [INFO ] Invariant cache hit.
[2023-03-11 07:45:54] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 262/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 179/185 places, 262/268 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-10 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 (AND (EQ s4 1) (EQ s13 1) (EQ s118 1) (EQ s145 1)) (AND (EQ s4 1) (EQ s6 1) (EQ s55 1) (EQ s145 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-10 finished in 611 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||(p1&&X(X(p2)))))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 181 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 181 transition count 264
Applied a total of 8 rules in 2 ms. Remains 181 /185 variables (removed 4) and now considering 264/268 (removed 4) transitions.
// Phase 1: matrix 264 rows 181 cols
[2023-03-11 07:45:54] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:45:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 07:45:54] [INFO ] Invariant cache hit.
[2023-03-11 07:45:54] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-11 07:45:55] [INFO ] Invariant cache hit.
[2023-03-11 07:45:55] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/185 places, 264/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 181/185 places, 264/268 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s45 1) (EQ s147 1)), p1:(EQ s50 1), p2:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 13 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-11 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 263
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 262
Applied a total of 12 rules in 9 ms. Remains 179 /185 variables (removed 6) and now considering 262/268 (removed 6) transitions.
// Phase 1: matrix 262 rows 179 cols
[2023-03-11 07:45:55] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:45:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-11 07:45:55] [INFO ] Invariant cache hit.
[2023-03-11 07:45:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-11 07:45:55] [INFO ] Invariant cache hit.
[2023-03-11 07:45:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 262/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 179/185 places, 262/268 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 159 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-13 finished in 537 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((X((!p0 U (p1||G(!p0)))) U (p2||G(!p3)))))'
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 263
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 262
Applied a total of 12 rules in 4 ms. Remains 179 /185 variables (removed 6) and now considering 262/268 (removed 6) transitions.
[2023-03-11 07:45:56] [INFO ] Invariant cache hit.
[2023-03-11 07:45:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:45:56] [INFO ] Invariant cache hit.
[2023-03-11 07:45:56] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-11 07:45:56] [INFO ] Invariant cache hit.
[2023-03-11 07:45:56] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 262/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 179/185 places, 262/268 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p2) p3), (AND (NOT p1) p0), (AND (NOT p1) p0 p3), (AND (NOT p2) p3), true, p3]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s38 1), p3:(AND (EQ s4 1) (EQ s6 1) (EQ s43 1) (EQ s145 1)), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s45 1) (EQ s145 1) (NOT (AND (EQ s4 1) (EQ s12 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 16 reset in 128 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), true, (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1282 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p2) p3), (AND p0 (NOT p1)), (AND p0 (NOT p1) p3), (AND (NOT p2) p3), true, p3]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-11 07:45:58] [INFO ] Invariant cache hit.
[2023-03-11 07:45:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 07:45:58] [INFO ] After 40ms SMT Verify possible using all constraints in real 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 p2 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), true, (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (G (NOT (AND p0 (NOT p1) p3))), (G (NOT (AND (NOT p2) p3)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p3)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p3))), (F p3), (F (AND p0 (NOT p1) (NOT p3)))]
Knowledge based reduction with 21 factoid took 1095 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p3)]
Stuttering acceptance computed with spot in 333 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p3)]
Support contains 8 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-11 07:46:00] [INFO ] Invariant cache hit.
[2023-03-11 07:46:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-11 07:46:00] [INFO ] Invariant cache hit.
[2023-03-11 07:46:00] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-11 07:46:00] [INFO ] Invariant cache hit.
[2023-03-11 07:46:00] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 179/179 places, 262/262 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) p1))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 952 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 07:46:02] [INFO ] Invariant cache hit.
[2023-03-11 07:46:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 07:46:02] [INFO ] After 50ms 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 (NOT p0) (NOT p1) p2 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) p1))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p3), (F (AND p3 (NOT p1))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 925 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) p3 (NOT p2)), (AND p0 (NOT p1) p3)]
Stuttering acceptance computed with spot in 326 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) p3 (NOT p2)), (AND p0 (NOT p1) p3)]
Stuttering acceptance computed with spot in 327 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) p3 (NOT p2)), (AND p0 (NOT p1) p3)]
Product exploration explored 100000 steps with 3 reset in 149 ms.
Product exploration explored 100000 steps with 5 reset in 111 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 226 ms :[true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) p3 (NOT p2)), (AND p0 (NOT p1) p3)]
Support contains 8 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 262/262 transitions.
Graph (trivial) has 161 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 177 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 73 place count 177 transition count 250
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 73 place count 177 transition count 250
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 177 transition count 250
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 140 place count 124 transition count 197
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 193 place count 124 transition count 197
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 124 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 124 transition count 201
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 280 place count 86 transition count 143
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 318 place count 86 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 325 place count 86 transition count 136
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 329 place count 82 transition count 132
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 333 place count 82 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 82 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 336 place count 80 transition count 130
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 80 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 340 place count 80 transition count 148
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 340 rules in 64 ms. Remains 80 /179 variables (removed 99) and now considering 148/262 (removed 114) transitions.
[2023-03-11 07:46:04] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 148 rows 80 cols
[2023-03-11 07:46:04] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:46:05] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/179 places, 148/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 80/179 places, 148/262 transitions.
Built C files in :
/tmp/ltsmin2214205217544194303
[2023-03-11 07:46:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2214205217544194303
Running compilation step : cd /tmp/ltsmin2214205217544194303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin2214205217544194303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2214205217544194303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13238734626573179111.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 179 cols
[2023-03-11 07:46:20] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:46:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-11 07:46:20] [INFO ] Invariant cache hit.
[2023-03-11 07:46:20] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-11 07:46:20] [INFO ] Invariant cache hit.
[2023-03-11 07:46:20] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 179/179 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin4169818285087152206
[2023-03-11 07:46:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4169818285087152206
Running compilation step : cd /tmp/ltsmin4169818285087152206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin4169818285087152206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4169818285087152206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1803866453146429492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:46:35] [INFO ] Flatten gal took : 14 ms
[2023-03-11 07:46:35] [INFO ] Flatten gal took : 13 ms
[2023-03-11 07:46:35] [INFO ] Time to serialize gal into /tmp/LTL5437619649763673450.gal : 4 ms
[2023-03-11 07:46:35] [INFO ] Time to serialize properties into /tmp/LTL6484125936057798584.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5437619649763673450.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15115077430710886768.hoa' '-atoms' '/tmp/LTL6484125936057798584.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6484125936057798584.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15115077430710886768.hoa
Detected timeout of ITS tools.
[2023-03-11 07:46:51] [INFO ] Flatten gal took : 21 ms
[2023-03-11 07:46:51] [INFO ] Flatten gal took : 40 ms
[2023-03-11 07:46:51] [INFO ] Time to serialize gal into /tmp/LTL13319261374968803106.gal : 7 ms
[2023-03-11 07:46:51] [INFO ] Time to serialize properties into /tmp/LTL5420344101542212869.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13319261374968803106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5420344101542212869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X((!("(((p6==1)&&(p15==1))&&((p80==1)&&(p178==1)))"))U((G(!("(((p6==1)&&(p15==1))&&((p80==1)&&(p178==1)))")))||("((((p6==1)&&(p1...313
Formula 0 simplified : F(X("(((p6==1)&&(p15==1))&&((p80==1)&&(p178==1)))" M !"((((p6==1)&&(p15==1))&&((p52==1)&&(p178==1)))&&(!(((p6==1)&&(p15==1))&&((p80=...241
Detected timeout of ITS tools.
[2023-03-11 07:47:06] [INFO ] Flatten gal took : 34 ms
[2023-03-11 07:47:06] [INFO ] Applying decomposition
[2023-03-11 07:47:06] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8141589113455764104.txt' '-o' '/tmp/graph8141589113455764104.bin' '-w' '/tmp/graph8141589113455764104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8141589113455764104.bin' '-l' '-1' '-v' '-w' '/tmp/graph8141589113455764104.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:47:06] [INFO ] Decomposing Gal with order
[2023-03-11 07:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:47:06] [INFO ] Removed a total of 239 redundant transitions.
[2023-03-11 07:47:06] [INFO ] Flatten gal took : 58 ms
[2023-03-11 07:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2023-03-11 07:47:06] [INFO ] Time to serialize gal into /tmp/LTL7162101818687863439.gal : 3 ms
[2023-03-11 07:47:06] [INFO ] Time to serialize properties into /tmp/LTL5206121953548541118.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7162101818687863439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5206121953548541118.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X((!("(((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i4.u24.p80==1)&&(i10.u1.p178==1)))"))U((G(!("(((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i...463
Formula 0 simplified : F(X("(((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i4.u24.p80==1)&&(i10.u1.p178==1)))" M !"((((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i2.u14.p52...363
Reverse transition relation is NOT exact ! Due to transitions t174, t179, t199, t211, t235, t265, i0.i1.u51.t33, i0.i1.u51.t36, i0.i1.u51.t37, i0.i1.u51.t3...617
Computing Next relation with stutter on 3616 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1693895399519592400
[2023-03-11 07:47:21] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1693895399519592400
Running compilation step : cd /tmp/ltsmin1693895399519592400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 386 ms.
Running link step : cd /tmp/ltsmin1693895399519592400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1693895399519592400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))) U ((LTLAPp2==true)||[](!(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-04b-LTLFireability-14 finished in 100682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 173 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 182 transition count 196
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 94 rules applied. Total rules applied 164 place count 113 transition count 171
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 179 place count 98 transition count 171
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 179 place count 98 transition count 163
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 195 place count 90 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 86 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 86 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 85 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 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 3 with 2 rules applied. Total rules applied 207 place count 85 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 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 5 with 70 rules applied. Total rules applied 278 place count 49 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 49 transition count 116
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 287 place count 41 transition count 83
Iterating global reduction 6 with 8 rules applied. Total rules applied 295 place count 41 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 298 place count 41 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 302 place count 39 transition count 78
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 304 place count 38 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 305 place count 38 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 36 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 308 place count 35 transition count 89
Applied a total of 308 rules in 40 ms. Remains 35 /185 variables (removed 150) and now considering 89/268 (removed 179) transitions.
// Phase 1: matrix 89 rows 35 cols
[2023-03-11 07:47:36] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:47:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 07:47:36] [INFO ] Invariant cache hit.
[2023-03-11 07:47:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:47:36] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [30, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 196 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/185 places, 89/268 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 88
Applied a total of 2 rules in 6 ms. Remains 32 /33 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 32 cols
[2023-03-11 07:47:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:47:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 07:47:37] [INFO ] Invariant cache hit.
[2023-03-11 07:47:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:47:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/185 places, 88/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 32/185 places, 88/268 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17 reset in 76 ms.
Product exploration explored 100000 steps with 17 reset in 45 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 19 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-11 07:47:37] [INFO ] Invariant cache hit.
[2023-03-11 07:47:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 07:47:37] [INFO ] Invariant cache hit.
[2023-03-11 07:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:47:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-11 07:47:38] [INFO ] Redundant transitions in 24 ms returned [28]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 87 rows 32 cols
[2023-03-11 07:47:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:47:38] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/32 places, 87/88 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 85
Applied a total of 2 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 30 cols
[2023-03-11 07:47:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 07:47:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 07:47:38] [INFO ] Invariant cache hit.
[2023-03-11 07:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:47:38] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/32 places, 85/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 30/32 places, 85/88 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 32 reset in 76 ms.
Product exploration explored 100000 steps with 59 reset in 50 ms.
Built C files in :
/tmp/ltsmin6360473974107959078
[2023-03-11 07:47:39] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2023-03-11 07:47:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:39] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2023-03-11 07:47:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:39] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2023-03-11 07:47:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6360473974107959078
Running compilation step : cd /tmp/ltsmin6360473974107959078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin6360473974107959078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6360473974107959078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased496540160654533340.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-15 finished in 3060 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((X((!p0 U (p1||G(!p0)))) U (p2||G(!p3)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-04b-LTLFireability-14
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p2) p3), (AND (NOT p1) p0), (AND (NOT p1) p0 p3), (AND (NOT p2) p3), true, p3]
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 167 edges and 185 vertex of which 4 / 185 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 182 transition count 199
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 91 rules applied. Total rules applied 158 place count 116 transition count 174
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 174 place count 101 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 100 transition count 173
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 175 place count 100 transition count 165
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 191 place count 92 transition count 165
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 195 place count 88 transition count 161
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 88 transition count 161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 87 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 87 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 87 transition count 156
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 5 with 70 rules applied. Total rules applied 272 place count 52 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 273 place count 52 transition count 119
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 279 place count 46 transition count 96
Iterating global reduction 6 with 6 rules applied. Total rules applied 285 place count 46 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 288 place count 46 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 292 place count 44 transition count 91
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 294 place count 43 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 295 place count 42 transition count 103
Applied a total of 295 rules in 39 ms. Remains 42 /185 variables (removed 143) and now considering 103/268 (removed 165) transitions.
// Phase 1: matrix 103 rows 42 cols
[2023-03-11 07:47:40] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:47:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 07:47:40] [INFO ] Invariant cache hit.
[2023-03-11 07:47:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:47:40] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 222 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 40/185 places, 103/268 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 39 transition count 102
Applied a total of 2 rules in 5 ms. Remains 39 /40 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 39 cols
[2023-03-11 07:47:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 07:47:40] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-11 07:47:40] [INFO ] Invariant cache hit.
[2023-03-11 07:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:47:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/185 places, 102/268 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 635 ms. Remains : 39/185 places, 102/268 transitions.
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s10 1), p3:(AND (EQ s2 1) (EQ s3 1) (EQ s12 1) (EQ s35 1)), p1:(AND (EQ s2 1) (EQ s7 1) (EQ s14 1) (EQ s35 1) (NOT (AND (EQ s2 1) (EQ s7 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 41 ms.
Entered a terminal (fully accepting) state of product in 161 steps with 8 reset in 0 ms.
Treatment of property AutonomousCar-PT-04b-LTLFireability-14 finished in 1139 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 07:47:40] [INFO ] Flatten gal took : 13 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 122564 ms.

BK_STOP 1678520863150

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593300588"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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