fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r021-smll-171620128100158
Last Updated
July 7, 2024

About the Execution of 2023-gold for AirplaneLD-PT-0020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.611 12801.00 23807.00 570.30 TFTTFFFFFTFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620128100158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r021-smll-171620128100158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 996K
-rw-r--r-- 1 mcc users 27K Apr 12 03:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 03:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 03:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 12 03:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 12 03:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 12 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 254K Apr 12 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 1716502808005

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 22:20:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 22:20:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:20:11] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-23 22:20:11] [INFO ] Transformed 159 places.
[2024-05-23 22:20:11] [INFO ] Transformed 168 transitions.
[2024-05-23 22:20:11] [INFO ] Found NUPN structural information;
[2024-05-23 22:20:11] [INFO ] Parsed PT model containing 159 places and 168 transitions and 638 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 62 places and 0 transitions.
FORMULA AirplaneLD-PT-0020-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 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
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 74 transition count 148
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 74 transition count 148
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 63 place count 74 transition count 128
Applied a total of 63 rules in 53 ms. Remains 74 /97 variables (removed 23) and now considering 128/168 (removed 40) transitions.
// Phase 1: matrix 128 rows 74 cols
[2024-05-23 22:20:12] [INFO ] Computed 1 invariants in 23 ms
[2024-05-23 22:20:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-23 22:20:12] [INFO ] Invariant cache hit.
[2024-05-23 22:20:12] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-23 22:20:12] [INFO ] Invariant cache hit.
[2024-05-23 22:20:12] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/97 places, 128/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 74/97 places, 128/168 transitions.
Support contains 71 out of 74 places after structural reductions.
[2024-05-23 22:20:12] [INFO ] Flatten gal took : 46 ms
[2024-05-23 22:20:13] [INFO ] Flatten gal took : 23 ms
[2024-05-23 22:20:13] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 1287 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Finished Best-First random walk after 2929 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=585 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 74 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 128
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(!p1))))'
Support contains 14 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 29 transition count 83
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 29 transition count 83
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 135 place count 29 transition count 38
Applied a total of 135 rules in 4 ms. Remains 29 /74 variables (removed 45) and now considering 38/128 (removed 90) transitions.
// Phase 1: matrix 38 rows 29 cols
[2024-05-23 22:20:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:20:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 22:20:14] [INFO ] Invariant cache hit.
[2024-05-23 22:20:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-23 22:20:14] [INFO ] Invariant cache hit.
[2024-05-23 22:20:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/74 places, 38/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 29/74 places, 38/128 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 286 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s6 1) (EQ s25 1)) (AND (EQ s7 1) (EQ s25 1)) (AND (EQ s5 1) (EQ s25 1)) (AND (EQ s8 1) (EQ s25 1)) (AND (EQ s10 1) (EQ s25 1)) (AND (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 8 reset in 11 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-01 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&G(F(p0))&&F(!p1))||G(p0))))'
Support contains 21 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Graph (complete) has 82 edges and 74 vertex of which 31 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.3 ms
Discarding 43 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 31 transition count 49
Applied a total of 20 rules in 15 ms. Remains 31 /74 variables (removed 43) and now considering 49/128 (removed 79) transitions.
// Phase 1: matrix 49 rows 31 cols
[2024-05-23 22:20:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:20:14] [INFO ] Implicit Places using invariants in 46 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/74 places, 49/128 transitions.
Graph (complete) has 27 edges and 30 vertex of which 29 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 29 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 47
Applied a total of 3 rules in 7 ms. Remains 28 /30 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 28 cols
[2024-05-23 22:20:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:20:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 22:20:14] [INFO ] Invariant cache hit.
[2024-05-23 22:20:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/74 places, 47/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 28/74 places, 47/128 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s0 1), p1:(OR (AND (EQ s2 1) (EQ s26 1)) (AND (EQ s7 1) (EQ s26 1)) (AND (EQ s12 1) (EQ s26 1)) (AND (EQ s14 1) (EQ s26 1)) (AND (EQ s17 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 21118 reset in 361 ms.
Product exploration explored 100000 steps with 21179 reset in 253 ms.
Computed a total of 28 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 47
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 (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 26 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-02 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Graph (complete) has 82 edges and 74 vertex of which 4 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /74 variables (removed 70) and now considering 4/128 (removed 124) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-23 22:20:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:15] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-23 22:20:15] [INFO ] Invariant cache hit.
[2024-05-23 22:20:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-23 22:20:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:20:15] [INFO ] Invariant cache hit.
[2024-05-23 22:20:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/74 places, 4/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 4/74 places, 4/128 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 (X p0)), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-03 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 13 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 30 transition count 84
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 30 transition count 84
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 30 transition count 40
Applied a total of 132 rules in 6 ms. Remains 30 /74 variables (removed 44) and now considering 40/128 (removed 88) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-23 22:20:16] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants in 42 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/74 places, 40/128 transitions.
Graph (complete) has 27 edges and 29 vertex of which 28 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 28 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 38
Applied a total of 3 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 27 cols
[2024-05-23 22:20:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 22:20:16] [INFO ] Invariant cache hit.
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants and state equation in 79 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 : 27/74 places, 38/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 27/74 places, 38/128 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-04 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 1) (AND (EQ s6 1) (EQ s23 1)) (AND (EQ s12 1) (EQ s23 1)) (AND (EQ s11 1) (EQ s23 1)) (AND (EQ s7 1) (EQ s23 1)) (AND (EQ s4 1) (EQ s23 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 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-04 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(G(p1))&&F(p2))))))'
Support contains 12 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 28 transition count 82
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 28 transition count 82
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 138 place count 28 transition count 36
Applied a total of 138 rules in 18 ms. Remains 28 /74 variables (removed 46) and now considering 36/128 (removed 92) transitions.
// Phase 1: matrix 36 rows 28 cols
[2024-05-23 22:20:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants in 51 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/74 places, 36/128 transitions.
Graph (complete) has 25 edges and 27 vertex of which 26 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 26 /27 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 26 cols
[2024-05-23 22:20:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 22:20:16] [INFO ] Invariant cache hit.
[2024-05-23 22:20:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/74 places, 35/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 26/74 places, 35/128 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s8 1) (EQ s22 1)) (AND (EQ s9 1) (EQ s22 1)) (AND (EQ s12 1) (EQ s22 1)) (AND (EQ s13 1) (EQ s22 1)) (AND (EQ s11 1) (EQ s22 1)) (AND (EQ ...], nbAcceptance=1, 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 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-06 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 21 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 36 transition count 90
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 36 transition count 90
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 114 place count 36 transition count 52
Applied a total of 114 rules in 5 ms. Remains 36 /74 variables (removed 38) and now considering 52/128 (removed 76) transitions.
// Phase 1: matrix 52 rows 36 cols
[2024-05-23 22:20:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:17] [INFO ] Implicit Places using invariants in 55 ms returned [35]
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 : 35/74 places, 52/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 35/74 places, 52/128 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s0 0) (AND (EQ s16 1) (EQ s31 1)) (AND (EQ s17 1) (EQ s31 1)) (AND (EQ s20 1) (EQ s31 1)) (AND (EQ s21 1) (EQ s31 1)) (AND (EQ s19 1) (EQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-07 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Graph (complete) has 82 edges and 74 vertex of which 53 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 53 transition count 89
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 56 place count 17 transition count 53
Iterating global reduction 1 with 36 rules applied. Total rules applied 92 place count 17 transition count 53
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 128 place count 17 transition count 17
Applied a total of 128 rules in 11 ms. Remains 17 /74 variables (removed 57) and now considering 17/128 (removed 111) transitions.
// Phase 1: matrix 17 rows 17 cols
[2024-05-23 22:20:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:17] [INFO ] Implicit Places using invariants in 33 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/74 places, 17/128 transitions.
Graph (complete) has 13 edges and 16 vertex of which 15 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 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 14 cols
[2024-05-23 22:20:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 22:20:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 22:20:17] [INFO ] Invariant cache hit.
[2024-05-23 22:20:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/74 places, 15/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 14/74 places, 15/128 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-08 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 s3 1) (AND (EQ s2 1) (EQ s11 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 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-08 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 20 transition count 74
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 20 transition count 74
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 162 place count 20 transition count 20
Applied a total of 162 rules in 4 ms. Remains 20 /74 variables (removed 54) and now considering 20/128 (removed 108) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:20:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:17] [INFO ] Implicit Places using invariants in 41 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/74 places, 20/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 19/74 places, 20/128 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-09 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 (NEQ s2 1) (NEQ s16 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 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 (Minato strategy)
Knowledge based reduction with 4 factoid took 20 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-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLFireability-09 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(!p1))) U X(p2)))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 20 transition count 74
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 20 transition count 74
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 162 place count 20 transition count 20
Applied a total of 162 rules in 4 ms. Remains 20 /74 variables (removed 54) and now considering 20/128 (removed 108) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:20:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:18] [INFO ] Implicit Places using invariants in 42 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/74 places, 20/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 19/74 places, 20/128 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s16 1)), p1:(NEQ s0 1), p2:(AND (EQ s11 1) (EQ s18 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLFireability-10 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 128/128 transitions.
Graph (complete) has 82 edges and 74 vertex of which 30 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 12 transition count 30
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 12 transition count 30
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 55 place count 12 transition count 12
Applied a total of 55 rules in 4 ms. Remains 12 /74 variables (removed 62) and now considering 12/128 (removed 116) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-23 22:20:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:20:18] [INFO ] Implicit Places using invariants in 35 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/74 places, 12/128 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-05-23 22:20:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 22:20:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 22:20:18] [INFO ] Invariant cache hit.
[2024-05-23 22:20:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/74 places, 10/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 9/74 places, 10/128 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 0), p1:(AND (EQ s2 1) (EQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21068 reset in 404 ms.
Product exploration explored 100000 steps with 21034 reset in 331 ms.
Computed a total of 9 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 10
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 (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 1 states, 4 edges and 2 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 977 ms.
All properties solved by simple procedures.
Total runtime 7929 ms.

BK_STOP 1716502820806

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-PT-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r021-smll-171620128100158"
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 ;