fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593400604
Last Updated
May 14, 2023

About the Execution of ITS-Tools for AutonomousCar-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1824.020 112676.00 232837.00 2458.10 FTFFFFFFFTFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400604.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K 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-05b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678520922243

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-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:48:44] [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:48:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:48:45] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2023-03-11 07:48:45] [INFO ] Transformed 255 places.
[2023-03-11 07:48:45] [INFO ] Transformed 490 transitions.
[2023-03-11 07:48:45] [INFO ] Found NUPN structural information;
[2023-03-11 07:48:45] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 220 transition count 455
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 220 transition count 455
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 170 place count 220 transition count 355
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 177 place count 213 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 184 place count 213 transition count 348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 212 transition count 347
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 212 transition count 347
Applied a total of 186 rules in 82 ms. Remains 212 /255 variables (removed 43) and now considering 347/490 (removed 143) transitions.
// Phase 1: matrix 347 rows 212 cols
[2023-03-11 07:48:45] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-11 07:48:46] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-11 07:48:46] [INFO ] Invariant cache hit.
[2023-03-11 07:48:46] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-11 07:48:46] [INFO ] Invariant cache hit.
[2023-03-11 07:48:46] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/255 places, 347/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 212/255 places, 347/490 transitions.
Support contains 44 out of 212 places after structural reductions.
[2023-03-11 07:48:47] [INFO ] Flatten gal took : 62 ms
[2023-03-11 07:48:47] [INFO ] Flatten gal took : 27 ms
[2023-03-11 07:48:47] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 43 out of 212 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:48:48] [INFO ] Invariant cache hit.
[2023-03-11 07:48:48] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:48:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 07:48:48] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-11 07:48:48] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 5 ms to minimize.
[2023-03-11 07:48:48] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2023-03-11 07:48:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-11 07:48:48] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 07:48:48] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 198 edges and 212 vertex of which 4 / 212 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 687 edges and 210 vertex of which 207 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 207 transition count 260
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 113 rules applied. Total rules applied 197 place count 127 transition count 227
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 216 place count 108 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 216 place count 108 transition count 221
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 228 place count 102 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 322 place count 55 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 55 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 333 place count 45 transition count 123
Iterating global reduction 4 with 10 rules applied. Total rules applied 343 place count 45 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 348 place count 45 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 356 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 362 place count 38 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 38 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 37 transition count 110
Applied a total of 364 rules in 55 ms. Remains 37 /212 variables (removed 175) and now considering 110/347 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 37/212 places, 110/347 transitions.
Finished random walk after 1849 steps, including 32 resets, run visited all 1 properties in 5 ms. (steps per millisecond=369 )
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 36 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 199 edges and 212 vertex of which 4 / 212 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 209 transition count 263
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 111 rules applied. Total rules applied 193 place count 128 transition count 233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 210 place count 111 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 210 place count 111 transition count 227
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 222 place count 105 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 223 place count 104 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 104 transition count 226
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 316 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 58 transition count 178
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 327 place count 48 transition count 127
Iterating global reduction 4 with 10 rules applied. Total rules applied 337 place count 48 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 341 place count 48 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 345 place count 46 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 44 transition count 119
Applied a total of 347 rules in 67 ms. Remains 44 /212 variables (removed 168) and now considering 119/347 (removed 228) transitions.
// Phase 1: matrix 119 rows 44 cols
[2023-03-11 07:48:49] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:48:49] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-11 07:48:49] [INFO ] Invariant cache hit.
[2023-03-11 07:48:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:48:49] [INFO ] Implicit Places using invariants and state equation in 312 ms returned [39, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 458 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/212 places, 119/347 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 41 transition count 118
Applied a total of 2 rules in 26 ms. Remains 41 /42 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 41 cols
[2023-03-11 07:48:50] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 07:48:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 07:48:50] [INFO ] Invariant cache hit.
[2023-03-11 07:48:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/212 places, 118/347 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 789 ms. Remains : 41/212 places, 118/347 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00 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:(OR (NEQ s1 1) (NEQ s7 1) (NEQ s13 1) (NEQ s37 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]]
Product exploration explored 100000 steps with 89 reset in 277 ms.
Product exploration explored 100000 steps with 1 reset in 110 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 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2952 steps, including 179 resets, run visited all 1 properties in 37 ms. (steps per millisecond=79 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-11 07:48:51] [INFO ] Invariant cache hit.
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-11 07:48:52] [INFO ] Invariant cache hit.
[2023-03-11 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-11 07:48:52] [INFO ] Redundant transitions in 25 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 117 rows 41 cols
[2023-03-11 07:48:52] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:48:52] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 117/118 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 39 transition count 115
Applied a total of 2 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 39 cols
[2023-03-11 07:48:52] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 07:48:52] [INFO ] Invariant cache hit.
[2023-03-11 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:48:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/41 places, 115/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 722 ms. Remains : 39/41 places, 115/118 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Built C files in :
/tmp/ltsmin1540297720071997843
[2023-03-11 07:48:53] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2023-03-11 07:48:53] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:53] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2023-03-11 07:48:53] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:53] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2023-03-11 07:48:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:48:53] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1540297720071997843
Running compilation step : cd /tmp/ltsmin1540297720071997843;'/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 646 ms.
Running link step : cd /tmp/ltsmin1540297720071997843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin1540297720071997843;'/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/stateBased6929157243072455245.hoa' '--buchi-type=spotba'
LTSmin run took 755 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 6154 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 U (p1||G(p0))))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 7 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:48:55] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:48:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 07:48:55] [INFO ] Invariant cache hit.
[2023-03-11 07:48:55] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-11 07:48:55] [INFO ] Invariant cache hit.
[2023-03-11 07:48:56] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s87 1) (NOT (AND (EQ s47 1) (EQ s77 1) (EQ s102 1) (EQ s127 1) (EQ s152 1) (EQ s174 1)))), p0:(NEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-01 finished in 1646 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)&&X(F(p1)))))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 14 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-11 07:48:57] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:48:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-11 07:48:57] [INFO ] Invariant cache hit.
[2023-03-11 07:48:57] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-11 07:48:57] [INFO ] Invariant cache hit.
[2023-03-11 07:48:57] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s60 0), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s97 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-03 finished in 979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G((!p1&&X((!p1 U (!p2||G(!p1)))))))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 11 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:48:58] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:48:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-11 07:48:58] [INFO ] Invariant cache hit.
[2023-03-11 07:48:58] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-11 07:48:58] [INFO ] Invariant cache hit.
[2023-03-11 07:48:58] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04 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=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s167 1), p1:(OR (EQ s62 1) (AND (EQ s4 1) (EQ s12 1) (EQ s71 1) (EQ s173 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1048 steps with 9 reset in 9 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 1050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(((X(p1)&&F((!p0 U (p2||G(!p0)))))||G(p1)))))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 10 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
[2023-03-11 07:48:59] [INFO ] Invariant cache hit.
[2023-03-11 07:48:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 07:48:59] [INFO ] Invariant cache hit.
[2023-03-11 07:48:59] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-11 07:48:59] [INFO ] Invariant cache hit.
[2023-03-11 07:48:59] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND p0 (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s90 1), p2:(AND (NEQ s90 1) (NOT (AND (EQ s4 1) (EQ s11 1) (EQ s121 1) (EQ s173 1)))), p1:(NEQ s20 1)], nbAcceptance=2, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-05 finished in 1200 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(p1)||p0)))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 10 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
[2023-03-11 07:49:00] [INFO ] Invariant cache hit.
[2023-03-11 07:49:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-11 07:49:00] [INFO ] Invariant cache hit.
[2023-03-11 07:49:01] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-11 07:49:01] [INFO ] Invariant cache hit.
[2023-03-11 07:49:01] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 812 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s4 0) (EQ s11 0) (EQ s148 0) (EQ s173 0)), p1:(AND (EQ s4 1) (EQ s14 1) (EQ s33 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 155 ms.
Product exploration explored 100000 steps with 11 reset in 109 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 816 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:49:02] [INFO ] Invariant cache hit.
[2023-03-11 07:49:03] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:49:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 07:49:03] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 07:49:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2023-03-11 07:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-11 07:49:03] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 07:49:03] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 342/342 transitions.
Graph (trivial) has 193 edges and 207 vertex of which 4 / 207 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 682 edges and 205 vertex of which 203 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 203 transition count 261
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 109 rules applied. Total rules applied 188 place count 128 transition count 227
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 208 place count 108 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 208 place count 108 transition count 221
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 220 place count 102 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 314 place count 55 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 55 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 45 transition count 123
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 45 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 340 place count 45 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 348 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 354 place count 38 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 38 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 37 transition count 110
Applied a total of 356 rules in 55 ms. Remains 37 /207 variables (removed 170) and now considering 110/342 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 37/207 places, 110/342 transitions.
Finished random walk after 4495 steps, including 58 resets, run visited all 1 properties in 9 ms. (steps per millisecond=499 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 11 factoid took 3019 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-11 07:49:06] [INFO ] Invariant cache hit.
[2023-03-11 07:49:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 07:49:07] [INFO ] Invariant cache hit.
[2023-03-11 07:49:07] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-11 07:49:07] [INFO ] Invariant cache hit.
[2023-03-11 07:49:07] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 207/207 places, 342/342 transitions.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Finished Best-First random walk after 5454 steps, including 10 resets, run visited all 2 properties in 9 ms. (steps per millisecond=606 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 723 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 23 reset in 126 ms.
Product exploration explored 100000 steps with 29 reset in 177 ms.
Built C files in :
/tmp/ltsmin9030790161150841670
[2023-03-11 07:49:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9030790161150841670
Running compilation step : cd /tmp/ltsmin9030790161150841670;'/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 557 ms.
Running link step : cd /tmp/ltsmin9030790161150841670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin9030790161150841670;'/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/stateBased5183474933201581492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 342/342 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-11 07:49:25] [INFO ] Invariant cache hit.
[2023-03-11 07:49:25] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-11 07:49:25] [INFO ] Invariant cache hit.
[2023-03-11 07:49:26] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2023-03-11 07:49:26] [INFO ] Invariant cache hit.
[2023-03-11 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 207/207 places, 342/342 transitions.
Built C files in :
/tmp/ltsmin12563495448706763786
[2023-03-11 07:49:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12563495448706763786
Running compilation step : cd /tmp/ltsmin12563495448706763786;'/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 565 ms.
Running link step : cd /tmp/ltsmin12563495448706763786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12563495448706763786;'/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/stateBased16007483823836030524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:49:41] [INFO ] Flatten gal took : 34 ms
[2023-03-11 07:49:41] [INFO ] Flatten gal took : 33 ms
[2023-03-11 07:49:41] [INFO ] Time to serialize gal into /tmp/LTL10021143799571576549.gal : 14 ms
[2023-03-11 07:49:42] [INFO ] Time to serialize properties into /tmp/LTL2510505155648646960.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10021143799571576549.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4871207702252449872.hoa' '-atoms' '/tmp/LTL2510505155648646960.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/LTL2510505155648646960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4871207702252449872.hoa
Detected timeout of ITS tools.
[2023-03-11 07:49:57] [INFO ] Flatten gal took : 34 ms
[2023-03-11 07:49:57] [INFO ] Flatten gal took : 32 ms
[2023-03-11 07:49:57] [INFO ] Time to serialize gal into /tmp/LTL5802763569476043395.gal : 4 ms
[2023-03-11 07:49:57] [INFO ] Time to serialize properties into /tmp/LTL8941465318699053792.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5802763569476043395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8941465318699053792.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...275
Read 1 LTL properties
Checking formula 0 : !((G(("(((p6==0)||(p14==0))||((p179==0)||(p212==0)))")||(X("(((p6==1)&&(p17==1))&&((p36==1)&&(p212==1)))")))))
Formula 0 simplified : F(!"(((p6==0)||(p14==0))||((p179==0)||(p212==0)))" & X!"(((p6==1)&&(p17==1))&&((p36==1)&&(p212==1)))")
Detected timeout of ITS tools.
[2023-03-11 07:50:12] [INFO ] Flatten gal took : 18 ms
[2023-03-11 07:50:12] [INFO ] Applying decomposition
[2023-03-11 07:50:12] [INFO ] Flatten gal took : 26 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/graph17173227755958104516.txt' '-o' '/tmp/graph17173227755958104516.bin' '-w' '/tmp/graph17173227755958104516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17173227755958104516.bin' '-l' '-1' '-v' '-w' '/tmp/graph17173227755958104516.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:50:12] [INFO ] Decomposing Gal with order
[2023-03-11 07:50:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:50:12] [INFO ] Removed a total of 448 redundant transitions.
[2023-03-11 07:50:13] [INFO ] Flatten gal took : 296 ms
[2023-03-11 07:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 18 ms.
[2023-03-11 07:50:13] [INFO ] Time to serialize gal into /tmp/LTL15211367860817792231.gal : 7 ms
[2023-03-11 07:50:13] [INFO ] Time to serialize properties into /tmp/LTL14920704318173366776.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15211367860817792231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14920704318173366776.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...256
Read 1 LTL properties
Checking formula 0 : !((G(("(((i14.u2.p6==0)||(i14.u2.p14==0))||((i11.u52.p179==0)||(i14.u2.p212==0)))")||(X("(((i14.u2.p6==1)&&(i14.u2.p17==1))&&((i2.i0.u...191
Formula 0 simplified : F(!"(((i14.u2.p6==0)||(i14.u2.p14==0))||((i11.u52.p179==0)||(i14.u2.p212==0)))" & X!"(((i14.u2.p6==1)&&(i14.u2.p17==1))&&((i2.i0.u10...185
Reverse transition relation is NOT exact ! Due to transitions t199, t204, t224, t259, t279, t299, t344, i1.u55.t34, i1.u55.t37, i1.u55.t38, i1.u55.t39, i2....691
Computing Next relation with stutter on 17888 deadlock states
263 unique states visited
263 strongly connected components in search stack
264 transitions explored
263 items max in DFS search stack
745 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.49605,189844,1,0,376844,5663,2998,547655,444,48543,489544
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-05b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 81266 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((p1||G(p2))))||p0)))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 13 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-11 07:50:21] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:50:21] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-11 07:50:21] [INFO ] Invariant cache hit.
[2023-03-11 07:50:23] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2023-03-11 07:50:23] [INFO ] Invariant cache hit.
[2023-03-11 07:50:24] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 1322 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s13 0) (EQ s148 0) (EQ s173 0)), p1:(EQ s66 0), p2:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 5016 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((F((X(p0) U p1))&&p2))&&X(G(p3))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 209 transition count 344
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 209 transition count 344
Applied a total of 6 rules in 8 ms. Remains 209 /212 variables (removed 3) and now considering 344/347 (removed 3) transitions.
// Phase 1: matrix 344 rows 209 cols
[2023-03-11 07:50:26] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-11 07:50:26] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 07:50:26] [INFO ] Invariant cache hit.
[2023-03-11 07:50:27] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-11 07:50:27] [INFO ] Invariant cache hit.
[2023-03-11 07:50:27] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/212 places, 344/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 209/212 places, 344/347 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p3), true, (OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 p3), acceptance={0} source=4 dest: 0}, { cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p3:(EQ s66 0), p2:(OR (EQ s79 1) (EQ s91 1)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s147 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 244 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-10 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 4 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:50:27] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:50:27] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 07:50:27] [INFO ] Invariant cache hit.
[2023-03-11 07:50:28] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2023-03-11 07:50:28] [INFO ] Invariant cache hit.
[2023-03-11 07:50:28] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s123 1), p0:(EQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 1049 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 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Graph (trivial) has 198 edges and 212 vertex of which 4 / 212 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 209 transition count 265
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 107 rules applied. Total rules applied 187 place count 130 transition count 237
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 204 place count 114 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 113 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 112 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 208 place count 112 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 222 place count 105 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 104 transition count 226
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 104 transition count 226
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 316 place count 58 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 317 place count 58 transition count 178
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 328 place count 47 transition count 122
Iterating global reduction 6 with 11 rules applied. Total rules applied 339 place count 47 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 344 place count 47 transition count 117
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 348 place count 45 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 351 place count 42 transition count 113
Applied a total of 351 rules in 65 ms. Remains 42 /212 variables (removed 170) and now considering 113/347 (removed 234) transitions.
// Phase 1: matrix 113 rows 42 cols
[2023-03-11 07:50:28] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:50:28] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 07:50:28] [INFO ] Invariant cache hit.
[2023-03-11 07:50:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:50:29] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [37, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/212 places, 113/347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 112
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 112/113 (removed 1) transitions.
// Phase 1: matrix 112 rows 39 cols
[2023-03-11 07:50:29] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 07:50:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 07:50:29] [INFO ] Invariant cache hit.
[2023-03-11 07:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/212 places, 112/347 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 39/212 places, 112/347 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13 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 s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 207 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 207 transition count 342
Applied a total of 10 rules in 17 ms. Remains 207 /212 variables (removed 5) and now considering 342/347 (removed 5) transitions.
// Phase 1: matrix 342 rows 207 cols
[2023-03-11 07:50:29] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:50:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-11 07:50:29] [INFO ] Invariant cache hit.
[2023-03-11 07:50:30] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-11 07:50:30] [INFO ] Invariant cache hit.
[2023-03-11 07:50:30] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/212 places, 342/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 207/212 places, 342/347 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s112 1), p1:(NEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Detected a total of 36/207 stabilizing places and 37/342 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-14 finished in 1549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((G(!p1)||(!p1&&F(!p2))))))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 208 transition count 343
Applied a total of 8 rules in 8 ms. Remains 208 /212 variables (removed 4) and now considering 343/347 (removed 4) transitions.
// Phase 1: matrix 343 rows 208 cols
[2023-03-11 07:50:31] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:50:32] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2023-03-11 07:50:32] [INFO ] Invariant cache hit.
[2023-03-11 07:50:32] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2023-03-11 07:50:32] [INFO ] Invariant cache hit.
[2023-03-11 07:50:33] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/212 places, 343/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1874 ms. Remains : 208/212 places, 343/347 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s66 0), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s46 1) (EQ s174 1)), p2:(AND (EQ s4 1) (EQ s12 1) (EQ s72 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Entered a terminal (fully accepting) state of product in 140 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 2423 ms.
All properties solved by simple procedures.
Total runtime 108878 ms.

BK_STOP 1678521034919

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-05b"
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-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593400604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;