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-165463872900444.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-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.0K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 128K Jun 7 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898456690

Running Version 202205111006
[2022-06-10 22:00:58] [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:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:00:59] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-06-10 22:00:59] [INFO ] Transformed 41 places.
[2022-06-10 22:00:59] [INFO ] Transformed 121 transitions.
[2022-06-10 22:00:59] [INFO ] Found NUPN structural information;
[2022-06-10 22:00:59] [INFO ] Parsed PT model containing 41 places and 121 transitions in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 71
Applied a total of 4 rules in 21 ms. Remains 39 /41 variables (removed 2) and now considering 71/76 (removed 5) transitions.
// Phase 1: matrix 71 rows 39 cols
[2022-06-10 22:00:59] [INFO ] Computed 7 place invariants in 18 ms
[2022-06-10 22:00:59] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 71 rows 39 cols
[2022-06-10 22:00:59] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 22:00:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-10 22:00:59] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [35, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 485 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/41 places, 71/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 37/41 places, 71/76 transitions.
Support contains 22 out of 37 places after structural reductions.
[2022-06-10 22:01:00] [INFO ] Flatten gal took : 73 ms
[2022-06-10 22:01:00] [INFO ] Flatten gal took : 32 ms
[2022-06-10 22:01:00] [INFO ] Input system was already deterministic with 71 transitions.
Incomplete random walk after 10000 steps, including 544 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 37 cols
[2022-06-10 22:01:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 22:01:01] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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' '!((p0 U (F(X(G(!F(G((G(p0)||p0))))))&&F(p0))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 67
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 33 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 32 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 32 transition count 65
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 31 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 29 transition count 57
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 29 transition count 57
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 20 place count 27 transition count 55
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 22 place count 26 transition count 55
Applied a total of 22 rules in 52 ms. Remains 26 /37 variables (removed 11) and now considering 55/71 (removed 16) transitions.
// Phase 1: matrix 55 rows 26 cols
[2022-06-10 22:01:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:01] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 55 rows 26 cols
[2022-06-10 22:01:01] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-10 22:01:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 22:01:01] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-06-10 22:01:01] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 55 rows 26 cols
[2022-06-10 22:01:01] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-10 22:01:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/37 places, 55/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/37 places, 55/71 transitions.
Stuttering acceptance computed with spot in 435 ms :[true, p0, (NOT p0), p0]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s19 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G((F(p0)&&p1)))||F(p1))))'
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 67
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 33 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 33 transition count 66
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 10 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 30 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 30 transition count 58
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 2 with 4 rules applied. Total rules applied 18 place count 28 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 27 transition count 56
Applied a total of 20 rules in 27 ms. Remains 27 /37 variables (removed 10) and now considering 56/71 (removed 15) transitions.
// Phase 1: matrix 56 rows 27 cols
[2022-06-10 22:01:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:02] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 56 rows 27 cols
[2022-06-10 22:01:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 22:01:02] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-06-10 22:01:02] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 56 rows 27 cols
[2022-06-10 22:01:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/37 places, 56/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/37 places, 56/71 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s7 1), p0:(AND (EQ s1 1) (EQ s4 1) (EQ s10 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-01 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!F(X(X(p0)))) U X(p1))))'
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 63
Applied a total of 4 rules in 4 ms. Remains 35 /37 variables (removed 2) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:03] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 22:01:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:03] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/37 places, 63/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/37 places, 63/71 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-03 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=(NOT p0), acceptance={} source=2 dest: 2}, { cond=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 s2 1) (EQ s7 1) (EQ s30 1)), p0:(EQ s11 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 1 reset in 381 ms.
Product exploration explored 100000 steps with 12 reset in 204 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) (NOT 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 309 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 158 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
Finished random walk after 27 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 244 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 148 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-10 22:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:05] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-10 22:01:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 22:01:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-10 22:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-10 22:01:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2022-06-10 22:01:05] [INFO ] Computed and/alt/rep : 24/67/24 causal constraints (skipped 38 transitions) in 14 ms.
[2022-06-10 22:01:05] [INFO ] Added : 16 causal constraints over 4 iterations in 114 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 35 transition count 59
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 31 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 31 transition count 58
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 10 place count 30 transition count 58
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 2 with 2 rules applied. Total rules applied 12 place count 29 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 28 transition count 57
Applied a total of 14 rules in 17 ms. Remains 28 /35 variables (removed 7) and now considering 57/63 (removed 6) transitions.
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:05] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:05] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-10 22:01:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 22:01:05] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-06-10 22:01:05] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/35 places, 57/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/35 places, 57/63 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 455 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 200 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
Finished random walk after 84 steps, including 7 resets, run visited all 3 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 8 factoid took 530 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 205 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-10 22:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:07] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-10 22:01:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 22:01:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-10 22:01:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 22:01:07] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2022-06-10 22:01:07] [INFO ] Computed and/alt/rep : 17/61/17 causal constraints (skipped 39 transitions) in 13 ms.
[2022-06-10 22:01:07] [INFO ] Added : 12 causal constraints over 3 iterations in 60 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 6 reset in 104 ms.
Product exploration explored 100000 steps with 6 reset in 323 ms.
Built C files in :
/tmp/ltsmin15225381987890141576
[2022-06-10 22:01:08] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-06-10 22:01:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:08] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-06-10 22:01:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:08] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-06-10 22:01:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15225381987890141576
Running compilation step : cd /tmp/ltsmin15225381987890141576;'/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 455 ms.
Running link step : cd /tmp/ltsmin15225381987890141576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15225381987890141576;'/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/stateBased5586894421235408678.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-03 finished in 6298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U X(G(!F(p1))))&&(X(p2)||p3)))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 63
Applied a total of 4 rules in 3 ms. Remains 35 /37 variables (removed 2) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:09] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:09] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/37 places, 63/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/37 places, 63/71 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1, (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s28 1), p3:(EQ s23 0), p1:(EQ s23 1), p2:(OR (EQ s1 0) (EQ s2 0) (EQ s13 0) (EQ s30 0))], nbAcceptance=2, 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 9 reset in 222 ms.
Product exploration explored 100000 steps with 23 reset in 206 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 p0) p3 (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2429 ms. Reduced automaton from 5 states, 24 edges and 4 AP to 5 states, 24 edges and 4 AP.
Stuttering acceptance computed with spot in 320 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 574 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 150 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 22:01:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-10 22:01:14] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X p1)), (G (NOT (AND p0 (NOT p3) (NOT p1)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p2)), (F (AND (NOT p3) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND p1 (NOT p2))), (F (AND (NOT p3) p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT p3)), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 34 factoid took 3480 ms. Reduced automaton from 5 states, 24 edges and 4 AP to 4 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 261 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Stuttering acceptance computed with spot in 253 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:18] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:18] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 63/63 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 : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1526 ms. Reduced automaton from 4 states, 18 edges and 4 AP to 4 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 287 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Finished random walk after 85 steps, including 5 resets, run visited all 10 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p3) p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT p3)), (F (NOT p2)), (F (AND p0 p1)), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 20 factoid took 1772 ms. Reduced automaton from 4 states, 18 edges and 4 AP to 4 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 263 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Stuttering acceptance computed with spot in 251 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Stuttering acceptance computed with spot in 243 ms :[(OR p1 (AND (NOT p2) (NOT p3))), p1, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p1]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 10 reset in 608 ms.
Built C files in :
/tmp/ltsmin15887740857918228350
[2022-06-10 22:01:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15887740857918228350
Running compilation step : cd /tmp/ltsmin15887740857918228350;'/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 275 ms.
Running link step : cd /tmp/ltsmin15887740857918228350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15887740857918228350;'/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/stateBased413771363116593860.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 15295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0)) U G(!(F(!p0)&&p1))))'
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 67
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 33 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 32 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 32 transition count 65
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 12 place count 31 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 30 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 30 transition count 61
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 3 with 2 rules applied. Total rules applied 16 place count 29 transition count 60
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 18 place count 28 transition count 60
Applied a total of 18 rules in 12 ms. Remains 28 /37 variables (removed 9) and now considering 60/71 (removed 11) transitions.
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:24] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-10 22:01:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-06-10 22:01:24] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:24] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/37 places, 60/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/37 places, 60/71 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s2 1) (EQ s18 1) (EQ s24 1) (EQ s10 1)), p0:(EQ s10 1)], nbAcceptance=2, 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 1 reset in 467 ms.
Product exploration explored 100000 steps with 5 reset in 304 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 651 ms. Reduced automaton from 3 states, 10 edges and 2 AP to 3 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 784 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:26] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 1116 ms. Reduced automaton from 3 states, 10 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:28] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:28] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 22:01:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-10 22:01:28] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-06-10 22:01:28] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 60 rows 28 cols
[2022-06-10 22:01:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 60/60 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 444 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 1336 steps, including 90 resets, run visited all 3 properties in 8 ms. (steps per millisecond=167 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 8 factoid took 535 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 129 ms.
Product exploration explored 100000 steps with 11 reset in 130 ms.
Built C files in :
/tmp/ltsmin13686342524229719236
[2022-06-10 22:01:30] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-06-10 22:01:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:30] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-06-10 22:01:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:30] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-06-10 22:01:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13686342524229719236
Running compilation step : cd /tmp/ltsmin13686342524229719236;'/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 508 ms.
Running link step : cd /tmp/ltsmin13686342524229719236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13686342524229719236;'/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/stateBased13283236213148607875.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 6531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)||p0))&&p2)))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 67
Applied a total of 2 rules in 2 ms. Remains 36 /37 variables (removed 1) and now considering 67/71 (removed 4) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:31] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:31] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/37 places, 67/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/37 places, 67/71 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s29 1) (AND (EQ s1 1) (EQ s5 1) (EQ s24 1) (EQ s31 1))), p0:(OR (EQ s1 0) (EQ s6 0) (EQ s15 0) (EQ s31 0)), p1:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 17 reset in 112 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 p2) p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 817 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 537 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:33] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 22:01:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:33] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT p0)), (F p2)]
Knowledge based reduction with 17 factoid took 779 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 22:01:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 22:01:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 22:01:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2022-06-10 22:01:34] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 41 transitions) in 10 ms.
[2022-06-10 22:01:34] [INFO ] Added : 5 causal constraints over 2 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:34] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 67/67 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 : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), true, (X (X p1)), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 57 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), true, (X (X p1)), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 456 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-10 22:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:35] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-10 22:01:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 22:01:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 22:01:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-10 22:01:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 7 ms returned sat
[2022-06-10 22:01:36] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 41 transitions) in 14 ms.
[2022-06-10 22:01:36] [INFO ] Added : 5 causal constraints over 2 iterations in 47 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 93 ms.
Stuttering criterion allowed to conclude after 190 steps with 12 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 5287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(G(G(!p0))) U X(p1))))'
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 63
Applied a total of 4 rules in 2 ms. Remains 35 /37 variables (removed 2) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:36] [INFO ] Implicit Places using invariants in 95 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/37 places, 63/71 transitions.
Applied a total of 0 rules in 7 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 34/37 places, 63/71 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), p1, (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s27 1), p1:(EQ s7 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12441 reset in 311 ms.
Product exploration explored 100000 steps with 12426 reset in 322 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 : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 20 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 34 cols
[2022-06-10 22:01:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 22:01:38] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 63 rows 34 cols
[2022-06-10 22:01:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:01:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:01:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 34 cols
[2022-06-10 22:01:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:01:38] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 63/63 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 : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 12438 reset in 257 ms.
Product exploration explored 100000 steps with 12439 reset in 255 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 63/63 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 34 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 34 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 34 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 34 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 34 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 8 ms. Remains 34 /34 variables (removed 0) and now considering 68/63 (removed -5) transitions.
[2022-06-10 22:01:40] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 68 rows 34 cols
[2022-06-10 22:01:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:01:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 68/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 68/63 transitions.
Product exploration explored 100000 steps with 12787 reset in 488 ms.
Product exploration explored 100000 steps with 12808 reset in 506 ms.
Built C files in :
/tmp/ltsmin8265035849450296209
[2022-06-10 22:01:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8265035849450296209
Running compilation step : cd /tmp/ltsmin8265035849450296209;'/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 253 ms.
Running link step : cd /tmp/ltsmin8265035849450296209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8265035849450296209;'/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/stateBased2935653565829969774.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 6105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(X(!((X(p1)&&p0) U p2))))))))'
Support contains 8 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 67
Applied a total of 2 rules in 2 ms. Remains 36 /37 variables (removed 1) and now considering 67/71 (removed 4) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:42] [INFO ] Computed 5 place invariants in 12 ms
[2022-06-10 22:01:42] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:42] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/37 places, 67/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/37 places, 67/71 transitions.
Stuttering acceptance computed with spot in 132 ms :[p2, p2, (AND p1 p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s19 1) (EQ s23 1) (EQ s32 1)), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s17 1) (EQ s31 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s17 1) (EQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 73 ms.
Product exploration explored 100000 steps with 8 reset in 71 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[p2, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 593 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:43] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F p2), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[p2, p2]
Stuttering acceptance computed with spot in 63 ms :[p2, p2]
Support contains 4 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 64
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 33 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 33 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 31 transition count 62
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 2 with 2 rules applied. Total rules applied 12 place count 30 transition count 62
Applied a total of 12 rules in 12 ms. Remains 30 /36 variables (removed 6) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 30 cols
[2022-06-10 22:01:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:43] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 62 rows 30 cols
[2022-06-10 22:01:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-10 22:01:44] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-06-10 22:01:44] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 62 rows 30 cols
[2022-06-10 22:01:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/36 places, 62/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/36 places, 62/67 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[p2, p2]
Finished random walk after 78 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[p2, p2]
Stuttering acceptance computed with spot in 86 ms :[p2, p2]
Stuttering acceptance computed with spot in 88 ms :[p2, p2]
Product exploration explored 100000 steps with 3 reset in 95 ms.
Product exploration explored 100000 steps with 2 reset in 96 ms.
Built C files in :
/tmp/ltsmin7269645986543607282
[2022-06-10 22:01:44] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-10 22:01:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:44] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-10 22:01:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:44] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-10 22:01:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7269645986543607282
Running compilation step : cd /tmp/ltsmin7269645986543607282;'/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 347 ms.
Running link step : cd /tmp/ltsmin7269645986543607282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7269645986543607282;'/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/stateBased2265164583700826519.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-11 finished in 2894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(F(p0)) U F(X(X(X(F(p0)))))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 67
Applied a total of 2 rules in 2 ms. Remains 36 /37 variables (removed 1) and now considering 67/71 (removed 4) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:45] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:45] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:45] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/37 places, 67/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/37 places, 67/71 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s17 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 103 ms.
Product exploration explored 100000 steps with 2 reset in 111 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 202 ms :[true, p0, p0, p0, p0]
Finished random walk after 334 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=167 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 203 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 201 ms :[true, p0, p0, p0, p0]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:47] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:47] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:47] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/36 places, 67/67 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 202 ms :[true, p0, p0, p0, p0]
Finished random walk after 419 steps, including 22 resets, run visited all 1 properties in 2 ms. (steps per millisecond=209 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 205 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 202 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 203 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 4 reset in 106 ms.
Product exploration explored 100000 steps with 6 reset in 117 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, p0, p0, p0, p0]
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 36 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 36 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 36 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 35 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 35 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 35 transition count 71
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 14 ms. Remains 35 /36 variables (removed 1) and now considering 71/67 (removed -4) transitions.
[2022-06-10 22:01:49] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 71 rows 35 cols
[2022-06-10 22:01:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:49] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/36 places, 71/67 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/36 places, 71/67 transitions.
Product exploration explored 100000 steps with 2 reset in 112 ms.
Product exploration explored 100000 steps with 20 reset in 117 ms.
Built C files in :
/tmp/ltsmin17422106658581232639
[2022-06-10 22:01:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17422106658581232639
Running compilation step : cd /tmp/ltsmin17422106658581232639;'/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 320 ms.
Running link step : cd /tmp/ltsmin17422106658581232639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17422106658581232639;'/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/stateBased13771834963752695123.hoa' '--buchi-type=spotba'
LTSmin run took 186 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 4537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 63
Applied a total of 4 rules in 2 ms. Remains 35 /37 variables (removed 2) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:49] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 22:01:49] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:49] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:50] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:50] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/37 places, 63/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/37 places, 63/71 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s5 1) (EQ s7 1) (EQ s30 1)), p0:(NEQ s17 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-13 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U (X(p1)&&X(p2)))&&G(F(F(p3))))))'
Support contains 5 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 63
Applied a total of 4 rules in 2 ms. Remains 35 /37 variables (removed 2) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:50] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-10 22:01:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-10 22:01:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/37 places, 63/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/37 places, 63/71 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p3) (AND p1 p2)), (AND p1 p2), (NOT p3), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s1 0) (EQ s5 0) (EQ s19 0) (EQ s30 0)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s19 1) (EQ s30 1)), p2:(EQ s3 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][false, false, false, false]]
Product exploration explored 100000 steps with 33248 reset in 346 ms.
Product exploration explored 100000 steps with 33205 reset in 369 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 p3 (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p1 p2))), true, (X (X p3))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p3) (AND p1 p2)), (NOT p3), true]
Incomplete random walk after 10000 steps, including 576 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 63 rows 35 cols
[2022-06-10 22:01:52] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-10 22:01:52] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p1 p2))), true, (X (X p3)), (G (OR (NOT p1) (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p3)), (F (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p3), (NOT p3)]
Support contains 4 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 35 transition count 60
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 32 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 31 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 31 transition count 58
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 10 place count 30 transition count 58
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 3 with 2 rules applied. Total rules applied 12 place count 29 transition count 57
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 14 place count 28 transition count 57
Applied a total of 14 rules in 15 ms. Remains 28 /35 variables (removed 7) and now considering 57/63 (removed 6) transitions.
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:53] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:53] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-10 22:01:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-10 22:01:53] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-06-10 22:01:53] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 57 rows 28 cols
[2022-06-10 22:01:53] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/35 places, 57/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/35 places, 57/63 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p3), (NOT p3)]
Finished random walk after 1716 steps, including 124 resets, run visited all 1 properties in 7 ms. (steps per millisecond=245 )
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 1 reset in 163 ms.
Built C files in :
/tmp/ltsmin18045759794558180192
[2022-06-10 22:01:54] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-06-10 22:01:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:54] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-06-10 22:01:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:54] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-06-10 22:01:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:01:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18045759794558180192
Running compilation step : cd /tmp/ltsmin18045759794558180192;'/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 331 ms.
Running link step : cd /tmp/ltsmin18045759794558180192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18045759794558180192;'/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/stateBased5874436557973700387.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-14 finished in 4574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||p1))))'
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 67
Applied a total of 2 rules in 3 ms. Remains 36 /37 variables (removed 1) and now considering 67/71 (removed 4) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:01:54] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-10 22:01:55] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 36 cols
[2022-06-10 22:01:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:01:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/37 places, 67/71 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/37 places, 67/71 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s7 1) (EQ s31 1)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s23 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 354 ms.
All properties solved by simple procedures.
Total runtime 56487 ms.

BK_STOP 1654898515571

--------------------
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-03a"
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-03a, 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-165463872900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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