Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Jun 7 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 7 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 177K Jun 3 16:02 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-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654901108416

Running Version 202205111006
[2022-06-10 22:45:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:45:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:45:10] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2022-06-10 22:45:10] [INFO ] Transformed 65 places.
[2022-06-10 22:45:10] [INFO ] Transformed 417 transitions.
[2022-06-10 22:45:10] [INFO ] Found NUPN structural information;
[2022-06-10 22:45:10] [INFO ] Parsed PT model containing 65 places and 417 transitions in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 32 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 64 cols
[2022-06-10 22:45:10] [INFO ] Computed 10 place invariants in 22 ms
[2022-06-10 22:45:11] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 257 rows 64 cols
[2022-06-10 22:45:11] [INFO ] Computed 10 place invariants in 16 ms
[2022-06-10 22:45:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-10 22:45:11] [INFO ] Implicit Places using invariants and state equation in 366 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 635 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 257/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/65 places, 257/258 transitions.
Support contains 36 out of 62 places after structural reductions.
[2022-06-10 22:45:12] [INFO ] Flatten gal took : 114 ms
[2022-06-10 22:45:12] [INFO ] Flatten gal took : 53 ms
[2022-06-10 22:45:12] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 591 resets, run finished after 892 ms. (steps per millisecond=11 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 257 rows 62 cols
[2022-06-10 22:45:13] [INFO ] Computed 8 place invariants in 4 ms
[2022-06-10 22:45:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-10 22:45:14] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 22:45:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-10 22:45:14] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 22:45:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-10 22:45:14] [INFO ] After 165ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 22:45:14] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-10 22:45:15] [INFO ] After 975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 61 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 257/257 transitions.
Graph (complete) has 518 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 61 transition count 248
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 56 transition count 248
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 56 transition count 245
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 53 transition count 245
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 48 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 48 transition count 216
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 2 with 2 rules applied. Total rules applied 32 place count 47 transition count 215
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 47 transition count 209
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 74 place count 41 transition count 179
Applied a total of 74 rules in 105 ms. Remains 41 /62 variables (removed 21) and now considering 179/257 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/62 places, 179/257 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 5) seen :2
Finished Best-First random walk after 918 steps, including 2 resets, run visited all 3 properties in 6 ms. (steps per millisecond=153 )
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(F(X(G(X(X(p0))))))) U p1))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 12 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:16] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:45:16] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:16] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 22:45:16] [INFO ] State equation strengthened by 117 read => feed constraints.
[2022-06-10 22:45:16] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:16] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:16] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/62 places, 222/257 transitions.
Stuttering acceptance computed with spot in 493 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s7 1) (EQ s44 1) (EQ s52 1)), p0:(OR (NEQ s11 1) (AND (EQ s1 1) (EQ s7 1) (EQ s44 1) (EQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 139 reset in 277 ms.
Product exploration explored 100000 steps with 56 reset in 131 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 5161 steps, including 260 resets, run visited all 3 properties in 54 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1)]
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:19] [INFO ] Computed 8 place invariants in 2 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 3456 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(!X(G(p0)))&&F(p1)) U p2))'
Support contains 8 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:19] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:19] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:19] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:19] [INFO ] State equation strengthened by 123 read => feed constraints.
[2022-06-10 22:45:19] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:19] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:45:20] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/62 places, 229/257 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1), true, p1]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s9 1) (EQ s21 1) (EQ s53 1)), p1:(AND (EQ s1 1) (EQ s8 1) (EQ s12 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s46 1) (EQ s53 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-02 finished in 840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 4 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:20] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:20] [INFO ] Implicit Places using invariants in 132 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 215/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 55/62 places, 215/257 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s14 1) (EQ s20 1) (EQ s26 1) (EQ s30 1) (EQ s36 1) (EQ s44 1) (EQ s51 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 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(!p1))))'
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 3 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:20] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:20] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:20] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 22:45:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:20] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:20] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 22:45:21] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 215/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/62 places, 215/257 transitions.
Stuttering acceptance computed with spot in 182 ms :[p1, (AND p1 (NOT p0)), p1, true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (EQ s13 1) (EQ s19 1) (EQ s27 1) (EQ s33 1) (EQ s39 1) (EQ s43 1) (EQ s52 1)) (NOT (AND (EQ s1 1) (EQ s6 1) (EQ s10 1) (EQ s51 1)))), p0:(AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(X((F(p0)&&p0)))))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 10 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:21] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:21] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:21] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:21] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:21] [INFO ] Computed 8 place invariants in 4 ms
[2022-06-10 22:45:21] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 215/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/62 places, 215/257 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s1 0) (EQ s6 0) (EQ s10 0) (EQ s51 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 219 reset in 94 ms.
Product exploration explored 100000 steps with 141 reset in 374 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 550 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1761855 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :{}
Probabilistic random walk after 1761855 steps, saw 260584 distinct states, run finished after 3006 ms. (steps per millisecond=586 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:26] [INFO ] Computed 8 place invariants in 4 ms
[2022-06-10 22:45:26] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:45:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-10 22:45:26] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:45:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:26] [INFO ] After 33ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 22:45:26] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-10 22:45:26] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 215/215 transitions.
Graph (complete) has 470 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 204
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 48 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 48 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 47 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 46 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 46 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 43 transition count 199
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 43 transition count 193
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 70 place count 37 transition count 163
Applied a total of 70 rules in 41 ms. Remains 37 /56 variables (removed 19) and now considering 163/215 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/56 places, 163/215 transitions.
Finished random walk after 1695 steps, including 6 resets, run visited all 1 properties in 7 ms. (steps per millisecond=242 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:26] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:26] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:27] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:27] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:27] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:27] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 579 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1869526 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1869526 steps, saw 275549 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:30] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:30] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:45:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-10 22:45:30] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:45:30] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:30] [INFO ] After 35ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 22:45:30] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-10 22:45:31] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 215/215 transitions.
Graph (complete) has 470 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 204
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 48 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 48 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 47 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 46 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 46 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 43 transition count 199
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 43 transition count 193
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 70 place count 37 transition count 163
Applied a total of 70 rules in 49 ms. Remains 37 /56 variables (removed 19) and now considering 163/215 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/56 places, 163/215 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished Best-First random walk after 6834 steps, including 22 resets, run visited all 1 properties in 10 ms. (steps per millisecond=683 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 6 states, 7 edges and 1 AP to 6 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 76 ms.
Product exploration explored 100000 steps with 12 reset in 90 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 56 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 56 transition count 217
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 56 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 56 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 55 transition count 216
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 55 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 219
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 13 rules in 49 ms. Remains 55 /56 variables (removed 1) and now considering 219/215 (removed -4) transitions.
[2022-06-10 22:45:32] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 219 rows 55 cols
[2022-06-10 22:45:32] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:33] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 219/215 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 219/215 transitions.
Product exploration explored 100000 steps with 24 reset in 119 ms.
Product exploration explored 100000 steps with 4 reset in 167 ms.
Built C files in :
/tmp/ltsmin4630369277228078357
[2022-06-10 22:45:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4630369277228078357
Running compilation step : cd /tmp/ltsmin4630369277228078357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 845 ms.
Running link step : cd /tmp/ltsmin4630369277228078357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4630369277228078357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1573316240738644705.hoa' '--buchi-type=spotba'
LTSmin run took 4211 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 17440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)||p0))))'
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 3 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:38] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-06-10 22:45:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 56 cols
[2022-06-10 22:45:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:39] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 215/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/62 places, 215/257 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s21 0) (EQ s25 0) (EQ s33 0) (EQ s39 0) (EQ s45 0) (EQ s52 0)), p1:(OR (EQ s1 0) (EQ s7 0) (EQ s44 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1084 ms.
Product exploration explored 100000 steps with 50000 reset in 874 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 2642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(F(X(F(p0))))))))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:41] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:45:41] [INFO ] Implicit Places using invariants in 169 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 222/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/62 places, 222/257 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18402 reset in 509 ms.
Product exploration explored 100000 steps with 18432 reset in 523 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 56 cols
[2022-06-10 22:45:43] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:43] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 222 rows 56 cols
[2022-06-10 22:45:43] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:45:44] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 56 cols
[2022-06-10 22:45:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:44] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 222/222 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18377 reset in 756 ms.
Product exploration explored 100000 steps with 18331 reset in 633 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 222/222 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 56 transition count 224
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 56 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 56 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 55 transition count 223
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 226
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 30 ms. Remains 55 /56 variables (removed 1) and now considering 226/222 (removed -4) transitions.
[2022-06-10 22:45:47] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 226 rows 55 cols
[2022-06-10 22:45:47] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:47] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 226/222 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/56 places, 226/222 transitions.
Product exploration explored 100000 steps with 18586 reset in 766 ms.
Product exploration explored 100000 steps with 18632 reset in 900 ms.
Built C files in :
/tmp/ltsmin11500757021726549294
[2022-06-10 22:45:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11500757021726549294
Running compilation step : cd /tmp/ltsmin11500757021726549294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1005 ms.
Running link step : cd /tmp/ltsmin11500757021726549294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11500757021726549294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5999277147308046183.hoa' '--buchi-type=spotba'
LTSmin run took 4669 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 13386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(F(p1))&&p0))&&p2)))'
Support contains 13 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 2 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:54] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:54] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 22:45:54] [INFO ] State equation strengthened by 123 read => feed constraints.
[2022-06-10 22:45:54] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 229 rows 58 cols
[2022-06-10 22:45:54] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:55] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/62 places, 229/257 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s6 1) (EQ s43 1) (EQ s53 1)), p0:(AND (EQ s13 1) (EQ s19 1) (EQ s25 1) (EQ s34 1) (EQ s40 1) (EQ s44 1) (EQ s54 1)), p2:(OR (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-08 finished in 583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((G(F(p0))&&F(p1))))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:55] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:55] [INFO ] State equation strengthened by 117 read => feed constraints.
[2022-06-10 22:45:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 57 cols
[2022-06-10 22:45:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:45:55] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/62 places, 222/257 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-09 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: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s24 1) (EQ s52 1)), p1:(OR (EQ s1 0) (EQ s2 0) (EQ s24 0) (EQ s52 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-09 finished in 755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(F((G(p0)&&X(p0))) U p1))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 250
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 54 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 52 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 52 transition count 247
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 51 transition count 247
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 25 place count 45 transition count 205
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 45 transition count 205
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 3 with 4 rules applied. Total rules applied 35 place count 43 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 42 transition count 203
Applied a total of 37 rules in 29 ms. Remains 42 /62 variables (removed 20) and now considering 203/257 (removed 54) transitions.
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:45:56] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:56] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-10 22:45:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:45:56] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-06-10 22:45:56] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:56] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:45:56] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 203/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/62 places, 203/257 transitions.
Stuttering acceptance computed with spot in 107 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s20 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 170 reset in 220 ms.
Product exploration explored 100000 steps with 48 reset in 301 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p0 p1)), (X p1), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p0 p1)), (X p1), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 42 /42 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:58] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:58] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:45:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:45:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2022-06-10 22:45:58] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 203 rows 42 cols
[2022-06-10 22:45:58] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:45:58] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 203/203 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 p1)), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 11 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 p1)), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 186 reset in 55 ms.
Product exploration explored 100000 steps with 60 reset in 68 ms.
Built C files in :
/tmp/ltsmin7210243681358517122
[2022-06-10 22:45:59] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2022-06-10 22:45:59] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:45:59] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2022-06-10 22:45:59] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:45:59] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2022-06-10 22:45:59] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:45:59] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7210243681358517122
Running compilation step : cd /tmp/ltsmin7210243681358517122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin7210243681358517122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7210243681358517122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15093785396157607617.hoa' '--buchi-type=spotba'
LTSmin run took 10224 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 14741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))||(p1 U (p1 U p2))||p3)))'
Support contains 10 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 4 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
// Phase 1: matrix 236 rows 59 cols
[2022-06-10 22:46:10] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:46:10] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 236 rows 59 cols
[2022-06-10 22:46:10] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:46:10] [INFO ] State equation strengthened by 129 read => feed constraints.
[2022-06-10 22:46:11] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 59 cols
[2022-06-10 22:46:11] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:46:11] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 236/257 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/62 places, 236/257 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 4}]], initial=6, aps=[p2:(AND (EQ s1 1) (EQ s8 1) (EQ s44 1) (EQ s54 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s26 1) (EQ s54 1)), p3:(AND (EQ s1 1) (EQ s6 1) (EQ s47 1) (EQ s54 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-15 finished in 698 ms.
All properties solved by simple procedures.
Total runtime 61220 ms.

BK_STOP 1654901171712

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06a"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06a, 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 r294-smll-165463873000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a 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 ;