Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300404.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 8.3K Apr 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 01:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 01:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 23K May 10 09:33 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 AutoFlight-PT-03a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652660550464

Running Version 202205111006
[2022-05-16 00:22:31] [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-05-16 00:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:22:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2022-05-16 00:22:31] [INFO ] Transformed 82 places.
[2022-05-16 00:22:31] [INFO ] Transformed 80 transitions.
[2022-05-16 00:22:31] [INFO ] Found NUPN structural information;
[2022-05-16 00:22:31] [INFO ] Parsed PT model containing 82 places and 80 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
FORMULA AutoFlight-PT-03a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2022-05-16 00:22:32] [INFO ] Computed 22 place invariants in 18 ms
[2022-05-16 00:22:32] [INFO ] Implicit Places using invariants in 172 ms returned [14, 24, 27, 30, 61, 67, 73, 79]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 200 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/82 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 64
Applied a total of 2 rules in 7 ms. Remains 73 /74 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 73 cols
[2022-05-16 00:22:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 00:22:32] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 64 rows 73 cols
[2022-05-16 00:22:32] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-16 00:22:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:22:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/82 places, 64/65 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/82 places, 64/65 transitions.
Support contains 29 out of 73 places after structural reductions.
[2022-05-16 00:22:32] [INFO ] Flatten gal took : 23 ms
[2022-05-16 00:22:32] [INFO ] Flatten gal took : 8 ms
[2022-05-16 00:22:32] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 64 rows 73 cols
[2022-05-16 00:22:33] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:33] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 00:22:33] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-16 00:22:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-16 00:22:33] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-16 00:22:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 00:22:33] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-05-16 00:22:33] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 00:22:33] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-03a-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 62
Applied a total of 4 rules in 5 ms. Remains 71 /73 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 71 cols
[2022-05-16 00:22:33] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 00:22:33] [INFO ] Implicit Places using invariants in 50 ms returned [7, 43, 70]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/73 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Applied a total of 6 rules in 11 ms. Remains 65 /68 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 65 cols
[2022-05-16 00:22:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 00:22:33] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 59 rows 65 cols
[2022-05-16 00:22:33] [INFO ] Computed 11 place invariants in 13 ms
[2022-05-16 00:22:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 65/73 places, 59/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/73 places, 59/64 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s19 1) (EQ s42 1)), p1:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-01 finished in 707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((G(p2)&&p1))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 66 transition count 57
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 66 transition count 46
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 55 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 53 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 53 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 47 transition count 38
Applied a total of 52 rules in 25 ms. Remains 47 /73 variables (removed 26) and now considering 38/64 (removed 26) transitions.
// Phase 1: matrix 38 rows 47 cols
[2022-05-16 00:22:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants in 55 ms returned [14, 15, 16, 17, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/73 places, 38/64 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 42 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 39 transition count 35
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 39 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 35 transition count 31
Applied a total of 14 rules in 6 ms. Remains 35 /42 variables (removed 7) and now considering 31/38 (removed 7) transitions.
// Phase 1: matrix 31 rows 35 cols
[2022-05-16 00:22:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 31 rows 35 cols
[2022-05-16 00:22:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/73 places, 31/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 35/73 places, 31/64 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s34 1)), p2:(OR (AND (EQ s21 1) (EQ s34 1)) (AND (EQ s5 1) (EQ s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-02 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!X(X(G(F(X(F(X(X(p0))))))))) U p1)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 66 transition count 57
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 66 transition count 45
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 54 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 52 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 52 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 47 transition count 38
Applied a total of 52 rules in 8 ms. Remains 47 /73 variables (removed 26) and now considering 38/64 (removed 26) transitions.
// Phase 1: matrix 38 rows 47 cols
[2022-05-16 00:22:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants in 45 ms returned [5, 15, 16, 17, 18, 27, 46]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 48 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/73 places, 38/64 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 40 transition count 28
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 30 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 29 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 29 transition count 27
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 26 place count 27 transition count 25
Applied a total of 26 rules in 9 ms. Remains 27 /40 variables (removed 13) and now considering 25/38 (removed 13) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-16 00:22:34] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-16 00:22:34] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 00:22:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 00:22:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/73 places, 25/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/73 places, 25/64 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s16 1)), p0:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-04 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((X(G(p0)) U p1)&&F(!p0)) U !p0))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 66 transition count 57
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 66 transition count 46
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 55 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 53 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 53 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 47 transition count 38
Applied a total of 52 rules in 9 ms. Remains 47 /73 variables (removed 26) and now considering 38/64 (removed 26) transitions.
// Phase 1: matrix 38 rows 47 cols
[2022-05-16 00:22:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants in 57 ms returned [5, 14, 15, 16, 27, 46]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 59 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/73 places, 38/64 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 41 transition count 29
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 32 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 31 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 31 transition count 28
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 24 place count 29 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 26 place count 28 transition count 45
Applied a total of 26 rules in 5 ms. Remains 28 /41 variables (removed 13) and now considering 45/38 (removed -7) transitions.
// Phase 1: matrix 45 rows 28 cols
[2022-05-16 00:22:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 45 rows 28 cols
[2022-05-16 00:22:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/73 places, 45/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 28/73 places, 45/64 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, false, p0, false, false]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s14 1), p1:(AND (EQ s7 1) (EQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 119 steps with 18 reset in 18 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-05 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (!(X(p0)||p1)||p1)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 62
Applied a total of 4 rules in 4 ms. Remains 71 /73 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 71 cols
[2022-05-16 00:22:35] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants in 58 ms returned [7, 20, 43, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Applied a total of 8 rules in 8 ms. Remains 63 /67 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 63 cols
[2022-05-16 00:22:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 58 rows 63 cols
[2022-05-16 00:22:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 00:22:35] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/73 places, 58/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 63/73 places, 58/64 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) p0), p0]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}]], initial=1, aps=[p1:(EQ s41 1), p0:(EQ s32 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-03a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03a-LTLFireability-08 finished in 712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(F(p0))||X(G(p0)))))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 70 transition count 44
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 51 transition count 44
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 51 transition count 36
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 59 place count 40 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 59 place count 40 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 37 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 36 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 36 transition count 32
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 30 transition count 26
Applied a total of 79 rules in 6 ms. Remains 30 /73 variables (removed 43) and now considering 26/64 (removed 38) transitions.
// Phase 1: matrix 26 rows 30 cols
[2022-05-16 00:22:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:22:36] [INFO ] Implicit Places using invariants in 27 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/73 places, 26/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 28 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 25
Applied a total of 2 rules in 2 ms. Remains 28 /29 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 28 cols
[2022-05-16 00:22:36] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 00:22:36] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 25 rows 28 cols
[2022-05-16 00:22:36] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 00:22:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/73 places, 25/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 28/73 places, 25/64 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7117 reset in 169 ms.
Product exploration explored 100000 steps with 7163 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1316 steps, including 87 resets, run visited all 1 properties in 6 ms. (steps per millisecond=219 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2022-05-16 00:22:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:37] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 25 rows 28 cols
[2022-05-16 00:22:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-05-16 00:22:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 28 cols
[2022-05-16 00:22:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 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 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 661 steps, including 49 resets, run visited all 1 properties in 3 ms. (steps per millisecond=220 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7197 reset in 112 ms.
Product exploration explored 100000 steps with 7120 reset in 117 ms.
Built C files in :
/tmp/ltsmin207946616212490657
[2022-05-16 00:22:38] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-05-16 00:22:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:38] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-05-16 00:22:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:38] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-05-16 00:22:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:38] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin207946616212490657
Running compilation step : cd /tmp/ltsmin207946616212490657;'/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 292 ms.
Running link step : cd /tmp/ltsmin207946616212490657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin207946616212490657;'/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/stateBased8710555271093476737.hoa' '--buchi-type=spotba'
LTSmin run took 210 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03a-LTLFireability-09 finished in 2652 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1&&(F(p2)||p2))))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 66 transition count 57
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 66 transition count 45
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 54 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 52 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 52 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 47 transition count 38
Applied a total of 52 rules in 9 ms. Remains 47 /73 variables (removed 26) and now considering 38/64 (removed 26) transitions.
// Phase 1: matrix 38 rows 47 cols
[2022-05-16 00:22:38] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:38] [INFO ] Implicit Places using invariants in 94 ms returned [5, 15, 16, 17, 18, 27]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 97 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/73 places, 38/64 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 41 transition count 33
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 36 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 36 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 32 transition count 29
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 20 place count 31 transition count 28
Applied a total of 20 rules in 21 ms. Remains 31 /41 variables (removed 10) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 31 cols
[2022-05-16 00:22:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:38] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 28 rows 31 cols
[2022-05-16 00:22:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 00:22:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/73 places, 28/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/73 places, 28/64 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s11 0), p0:(OR (EQ s5 0) (EQ s17 0)), p2:(AND (EQ s14 1) (EQ s30 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-10 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||p0) U G(!X(!(X(p1)&&p0)))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 62
Applied a total of 4 rules in 4 ms. Remains 71 /73 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 71 cols
[2022-05-16 00:22:39] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants in 81 ms returned [7, 20, 43, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 17 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:39] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/73 places, 52/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/73 places, 52/64 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s2 1), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-11 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F(X(X(p0))))))||p1)))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 62
Applied a total of 4 rules in 2 ms. Remains 71 /73 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 71 cols
[2022-05-16 00:22:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants in 80 ms returned [7, 20, 43, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 21 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:39] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 00:22:39] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/73 places, 52/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/73 places, 52/64 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (EQ s9 1) (EQ s48 1)), p0:(AND (EQ s7 1) (EQ s39 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]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-12 finished in 538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(G(X(F(p0)))))||G(X(F(p1))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 70 transition count 44
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 51 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 40 place count 51 transition count 38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 43 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 54 place count 43 transition count 36
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 58 place count 41 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 40 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 40 transition count 35
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 34 transition count 29
Applied a total of 72 rules in 4 ms. Remains 34 /73 variables (removed 39) and now considering 29/64 (removed 35) transitions.
// Phase 1: matrix 29 rows 34 cols
[2022-05-16 00:22:40] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:40] [INFO ] Implicit Places using invariants in 29 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/73 places, 29/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 28
Applied a total of 2 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 28/29 (removed 1) transitions.
// Phase 1: matrix 28 rows 32 cols
[2022-05-16 00:22:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:22:40] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 28 rows 32 cols
[2022-05-16 00:22:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:22:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/73 places, 28/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/73 places, 28/64 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s31 0)), p1:(AND (EQ s12 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6262 reset in 238 ms.
Product exploration explored 100000 steps with 6216 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 630 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1645 steps, run visited all 1 properties in 19 ms. (steps per millisecond=86 )
Probabilistic random walk after 1645 steps, saw 668 distinct states, run finished after 19 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 32 cols
[2022-05-16 00:22:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:22:41] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 28 rows 32 cols
[2022-05-16 00:22:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:22:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 00:22:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 32 cols
[2022-05-16 00:22:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:22:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7893 steps, including 473 resets, run visited all 1 properties in 19 ms. (steps per millisecond=415 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6265 reset in 87 ms.
Product exploration explored 100000 steps with 6324 reset in 152 ms.
Built C files in :
/tmp/ltsmin14083349665368648402
[2022-05-16 00:22:42] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2022-05-16 00:22:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:42] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2022-05-16 00:22:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:42] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2022-05-16 00:22:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:22:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14083349665368648402
Running compilation step : cd /tmp/ltsmin14083349665368648402;'/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 159 ms.
Running link step : cd /tmp/ltsmin14083349665368648402;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14083349665368648402;'/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/stateBased2165219922743440312.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03a-LTLFireability-14 finished in 2793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(p0))))||G(p1)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 62
Applied a total of 4 rules in 1 ms. Remains 71 /73 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 71 cols
[2022-05-16 00:22:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 00:22:43] [INFO ] Implicit Places using invariants in 49 ms returned [7, 20, 43, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 7 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:43] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:43] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:43] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/73 places, 52/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/73 places, 52/64 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s24 0), p1:(AND (EQ s9 1) (EQ s48 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 11941 reset in 99 ms.
Product exploration explored 100000 steps with 11860 reset in 110 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 00:22:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 57 cols
[2022-05-16 00:22:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 52/52 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11850 reset in 107 ms.
Product exploration explored 100000 steps with 11879 reset in 141 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 57 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 57 transition count 52
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 57 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 49 transition count 44
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 49 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 49 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 48 rules in 9 ms. Remains 45 /57 variables (removed 12) and now considering 40/52 (removed 12) transitions.
[2022-05-16 00:22:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 45 cols
[2022-05-16 00:22:45] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 00:22:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/57 places, 40/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/57 places, 40/52 transitions.
Product exploration explored 100000 steps with 13406 reset in 186 ms.
Stack based approach found an accepted trace after 847 steps with 110 reset with depth 15 and stack size 13 in 4 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-15 finished in 3005 ms.
All properties solved by simple procedures.
Total runtime 14338 ms.

BK_STOP 1652660566139

--------------------
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="AutoFlight-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 AutoFlight-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 r006-tajo-165245689300404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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