Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 24K Feb 26 11:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 11:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 26 11:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 242K Feb 26 11:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678620915729

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:35:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:35:17] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-12 11:35:17] [INFO ] Transformed 159 places.
[2023-03-12 11:35:17] [INFO ] Transformed 168 transitions.
[2023-03-12 11:35:17] [INFO ] Parsed PT model containing 159 places and 168 transitions and 638 arcs in 157 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.
Reduce places removed 62 places and 0 transitions.
FORMULA AirplaneLD-PT-0020-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 168/168 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 168
Applied a total of 3 rules in 23 ms. Remains 94 /97 variables (removed 3) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 94 cols
[2023-03-12 11:35:18] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-12 11:35:18] [INFO ] Invariant cache hit.
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-12 11:35:18] [INFO ] Invariant cache hit.
[2023-03-12 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/97 places, 168/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 94/97 places, 168/168 transitions.
Support contains 92 out of 94 places after structural reductions.
[2023-03-12 11:35:18] [INFO ] Flatten gal took : 41 ms
[2023-03-12 11:35:18] [INFO ] Flatten gal took : 14 ms
[2023-03-12 11:35:19] [INFO ] Input system was already deterministic with 168 transitions.
Finished random walk after 366 steps, including 46 resets, run visited all 17 properties in 43 ms. (steps per millisecond=8 )
FORMULA AirplaneLD-PT-0020-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 94 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 168
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))||G(!p1))))'
Support contains 16 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 30 transition count 104
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 30 transition count 104
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 192 place count 30 transition count 40
Applied a total of 192 rules in 3 ms. Remains 30 /94 variables (removed 64) and now considering 40/168 (removed 128) transitions.
// Phase 1: matrix 40 rows 30 cols
[2023-03-12 11:35:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 11:35:19] [INFO ] Invariant cache hit.
[2023-03-12 11:35:19] [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.
[2023-03-12 11:35:19] [INFO ] Invariant cache hit.
[2023-03-12 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/94 places, 40/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 30/94 places, 40/168 transitions.
Stuttering acceptance computed with spot in 295 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s24 1) (GEQ s29 1)), p1:(AND (OR (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s12 1) (GEQ s25 1)) (AND (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s7 1) (GE...], 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]]
Product exploration explored 100000 steps with 29221 reset in 259 ms.
Product exploration explored 100000 steps with 29163 reset in 197 ms.
Computed a total of 30 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-00 finished in 1310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((((p1 U p2) U p2)||p0) U X((X(p1)&&p1)))))'
Support contains 23 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 38 transition count 112
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 38 transition count 112
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 168 place count 38 transition count 56
Applied a total of 168 rules in 8 ms. Remains 38 /94 variables (removed 56) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 38 cols
[2023-03-12 11:35:20] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 11:35:20] [INFO ] Implicit Places using invariants in 50 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/94 places, 56/168 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 37/94 places, 56/168 transitions.
Stuttering acceptance computed with spot in 515 ms :[true, p1, p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(OR p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 7}]], initial=1, aps=[p1:(GEQ s30 1), p2:(OR (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s20 1) (GEQ s33 1)) (AND (GEQ s19 1) (GEQ s33 1)) (AND (GEQ s15 1) (GEQ s33 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-02 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 22 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 38 transition count 112
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 38 transition count 112
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 168 place count 38 transition count 56
Applied a total of 168 rules in 2 ms. Remains 38 /94 variables (removed 56) and now considering 56/168 (removed 112) transitions.
// Phase 1: matrix 56 rows 38 cols
[2023-03-12 11:35:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:21] [INFO ] Implicit Places using invariants in 54 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/94 places, 56/168 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 37/94 places, 56/168 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s7 1) (GEQ s34 1)) (AND (GEQ s5 1) (GEQ s34 1)) (AND (GEQ s8 1) (GEQ s34 1)) (AND (GEQ s10 1) (GEQ s34 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-03 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 30 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 46 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 46 transition count 120
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 144 place count 46 transition count 72
Applied a total of 144 rules in 4 ms. Remains 46 /94 variables (removed 48) and now considering 72/168 (removed 96) transitions.
// Phase 1: matrix 72 rows 46 cols
[2023-03-12 11:35:21] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 11:35:21] [INFO ] Implicit Places using invariants in 53 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/94 places, 72/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 45/94 places, 72/168 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s43 1)) (AND (GEQ s25 1) (GEQ s43 1)) (AND (GEQ s27 1) (GEQ s43 1)) (AND (GEQ s30 1) (GEQ s43 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-04 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&F(p0))))'
Support contains 30 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 46 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 46 transition count 120
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 144 place count 46 transition count 72
Applied a total of 144 rules in 17 ms. Remains 46 /94 variables (removed 48) and now considering 72/168 (removed 96) transitions.
[2023-03-12 11:35:21] [INFO ] Invariant cache hit.
[2023-03-12 11:35:21] [INFO ] Implicit Places using invariants in 52 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/94 places, 72/168 transitions.
Graph (complete) has 43 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 43 transition count 70
Applied a total of 3 rules in 3 ms. Remains 43 /45 variables (removed 2) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 43 cols
[2023-03-12 11:35:21] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-12 11:35:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 11:35:22] [INFO ] Invariant cache hit.
[2023-03-12 11:35:22] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/94 places, 70/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 43/94 places, 70/168 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s41 1)) (AND (GEQ s20 1) (GEQ s41 1)) (AND (GEQ s25 1) (GEQ s41 1)) (AND (GEQ s27 1) (GEQ s41 1)) (AND (GEQ s30 1) (GEQ s41 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 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-05 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 37 transition count 111
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 37 transition count 111
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 171 place count 37 transition count 54
Applied a total of 171 rules in 2 ms. Remains 37 /94 variables (removed 57) and now considering 54/168 (removed 114) transitions.
// Phase 1: matrix 54 rows 37 cols
[2023-03-12 11:35:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:22] [INFO ] Implicit Places using invariants in 29 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/94 places, 54/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 36/94 places, 54/168 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, p0, p0]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s11 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s34 1)) (AND (GEQ s18 1) (GEQ s34 1)) (AND (GEQ s21 1) (GEQ s34 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-06 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X((!p1||F(p2)))))))'
Support contains 35 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 50 transition count 124
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 50 transition count 124
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 132 place count 50 transition count 80
Applied a total of 132 rules in 2 ms. Remains 50 /94 variables (removed 44) and now considering 80/168 (removed 88) transitions.
// Phase 1: matrix 80 rows 50 cols
[2023-03-12 11:35:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:22] [INFO ] Implicit Places using invariants in 32 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/94 places, 80/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 49/94 places, 80/168 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s21 1) (LT s47 1)) (OR (LT s26 1) (LT s47 1)) (OR (LT s38 1) (LT s47 1)) (OR (LT s36 1) (LT s47 1)) (OR (LT s31 1) (LT s47 1)) (OR (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Computed a total of 49 stabilizing places and 80 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 80
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-07 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 19 transition count 93
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 19 transition count 93
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 225 place count 19 transition count 18
Applied a total of 225 rules in 5 ms. Remains 19 /94 variables (removed 75) and now considering 18/168 (removed 150) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:35:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:23] [INFO ] Implicit Places using invariants in 46 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/94 places, 18/168 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 18/94 places, 18/168 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-10 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 19 transition count 93
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 19 transition count 93
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 225 place count 19 transition count 18
Applied a total of 225 rules in 3 ms. Remains 19 /94 variables (removed 75) and now considering 18/168 (removed 150) transitions.
[2023-03-12 11:35:23] [INFO ] Invariant cache hit.
[2023-03-12 11:35:23] [INFO ] Implicit Places using invariants in 43 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/94 places, 18/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 18/94 places, 18/168 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (GEQ s11 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][false, false]]
Product exploration explored 100000 steps with 38418 reset in 97 ms.
Product exploration explored 100000 steps with 38538 reset in 124 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-11 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Graph (complete) has 122 edges and 94 vertex of which 8 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.0 ms
Discarding 86 places :
Also discarding 160 output transitions
Drop transitions removed 160 transitions
Applied a total of 1 rules in 27 ms. Remains 8 /94 variables (removed 86) and now considering 8/168 (removed 160) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-12 11:35:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:24] [INFO ] Implicit Places using invariants in 43 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/94 places, 8/168 transitions.
Graph (complete) has 5 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 5 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-12 11:35:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:35:24] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-12 11:35:24] [INFO ] Invariant cache hit.
[2023-03-12 11:35:24] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/94 places, 7/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 6/94 places, 7/168 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1)), p1:(OR (LT s1 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25036 reset in 135 ms.
Product exploration explored 100000 steps with 24990 reset in 145 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-12 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Graph (complete) has 122 edges and 94 vertex of which 4 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 164 output transitions
Drop transitions removed 164 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /94 variables (removed 90) and now considering 4/168 (removed 164) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-12 11:35:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 11:35:25] [INFO ] Invariant cache hit.
[2023-03-12 11:35:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-12 11:35:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:35:25] [INFO ] Invariant cache hit.
[2023-03-12 11:35:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/94 places, 4/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 4/94 places, 4/168 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-14 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 168/168 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 21 transition count 95
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 21 transition count 95
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 219 place count 21 transition count 22
Applied a total of 219 rules in 7 ms. Remains 21 /94 variables (removed 73) and now considering 22/168 (removed 146) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-12 11:35:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:25] [INFO ] Implicit Places using invariants in 51 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/94 places, 22/168 transitions.
Graph (complete) has 19 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 20
Applied a total of 3 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-12 11:35:25] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 11:35:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 11:35:25] [INFO ] Invariant cache hit.
[2023-03-12 11:35:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/94 places, 20/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 18/94 places, 20/168 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-15 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 (LT s5 1) (LT s14 1) (AND (GEQ s9 1) (GEQ s16 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 14258 reset in 124 ms.
Product exploration explored 100000 steps with 14302 reset in 68 ms.
Computed a total of 18 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-15 finished in 719 ms.
All properties solved by simple procedures.
Total runtime 8352 ms.
ITS solved all properties within timeout

BK_STOP 1678620926637

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="AirplaneLD-PT-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AirplaneLD-PT-0020, 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 r009-oct2-167813597600252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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