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.r043-smll-171620180100088.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 AutoFlight-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 43K 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 AutoFlight-PT-06a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716279888428

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=AutoFlight-PT-06a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 08:24:51] [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-21 08:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:24:51] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 08:24:51] [INFO ] Transformed 157 places.
[2024-05-21 08:24:51] [INFO ] Transformed 155 transitions.
[2024-05-21 08:24:51] [INFO ] Found NUPN structural information;
[2024-05-21 08:24:51] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA AutoFlight-PT-06a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 24 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2024-05-21 08:24:51] [INFO ] Computed 40 invariants in 20 ms
[2024-05-21 08:24:52] [INFO ] Implicit Places using invariants in 525 ms returned [42, 45, 51, 57, 60, 92, 118, 136, 142, 154, 156]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 568 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/157 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 121
Applied a total of 8 rules in 20 ms. Remains 142 /146 variables (removed 4) and now considering 121/125 (removed 4) transitions.
// Phase 1: matrix 121 rows 142 cols
[2024-05-21 08:24:52] [INFO ] Computed 29 invariants in 3 ms
[2024-05-21 08:24:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 08:24:52] [INFO ] Invariant cache hit.
[2024-05-21 08:24:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:24:52] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/157 places, 121/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 982 ms. Remains : 142/157 places, 121/125 transitions.
Support contains 43 out of 142 places after structural reductions.
[2024-05-21 08:24:52] [INFO ] Flatten gal took : 47 ms
[2024-05-21 08:24:52] [INFO ] Flatten gal took : 20 ms
[2024-05-21 08:24:53] [INFO ] Input system was already deterministic with 121 transitions.
Support contains 42 out of 142 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 26) seen :24
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 08:24:53] [INFO ] Invariant cache hit.
[2024-05-21 08:24:53] [INFO ] [Real]Absence check using 29 positive place invariants in 20 ms returned sat
[2024-05-21 08:24:53] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-06a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 1 stable transitions
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(X(F(p0))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 115
Applied a total of 12 rules in 42 ms. Remains 136 /142 variables (removed 6) and now considering 115/121 (removed 6) transitions.
// Phase 1: matrix 115 rows 136 cols
[2024-05-21 08:24:54] [INFO ] Computed 29 invariants in 3 ms
[2024-05-21 08:24:54] [INFO ] Implicit Places using invariants in 153 ms returned [7, 14, 21, 28, 35, 46, 51, 110, 116, 130]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 154 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/142 places, 115/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 112
Applied a total of 6 rules in 5 ms. Remains 123 /126 variables (removed 3) and now considering 112/115 (removed 3) transitions.
// Phase 1: matrix 112 rows 123 cols
[2024-05-21 08:24:54] [INFO ] Computed 19 invariants in 2 ms
[2024-05-21 08:24:54] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 08:24:54] [INFO ] Invariant cache hit.
[2024-05-21 08:24:54] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/142 places, 112/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 123/142 places, 112/121 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 274 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-00 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:(OR (EQ s0 1) (EQ s80 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 23 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-00 finished in 826 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||G((X(p2)||p1))))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Applied a total of 4 rules in 9 ms. Remains 140 /142 variables (removed 2) and now considering 119/121 (removed 2) transitions.
// Phase 1: matrix 119 rows 140 cols
[2024-05-21 08:24:54] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:24:55] [INFO ] Implicit Places using invariants in 126 ms returned [7, 14, 35, 46, 51, 114, 120, 134]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 128 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/142 places, 119/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 116
Applied a total of 6 rules in 7 ms. Remains 129 /132 variables (removed 3) and now considering 116/119 (removed 3) transitions.
// Phase 1: matrix 116 rows 129 cols
[2024-05-21 08:24:55] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 08:24:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 08:24:55] [INFO ] Invariant cache hit.
[2024-05-21 08:24:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 08:24:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/142 places, 116/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 129/142 places, 116/121 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s19 0) (EQ s82 0)), p0:(AND (EQ s19 1) (EQ s82 1) (EQ s25 1)), p2:(AND (OR (EQ s19 0) (EQ s82 0)) (OR (EQ s26 0) (EQ s83 0)))], 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 2770 reset in 446 ms.
Product exploration explored 100000 steps with 2809 reset in 329 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 167 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 291 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 08:24:56] [INFO ] Invariant cache hit.
[2024-05-21 08:24:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 489 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 08:24:57] [INFO ] Invariant cache hit.
[2024-05-21 08:24:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 08:24:57] [INFO ] Invariant cache hit.
[2024-05-21 08:24:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 08:24:57] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-21 08:24:57] [INFO ] Invariant cache hit.
[2024-05-21 08:24:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 129/129 places, 116/116 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 47 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 8 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2825 reset in 226 ms.
Product exploration explored 100000 steps with 2773 reset in 477 ms.
Built C files in :
/tmp/ltsmin2097673448152754540
[2024-05-21 08:24:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2097673448152754540
Running compilation step : cd /tmp/ltsmin2097673448152754540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 463 ms.
Running link step : cd /tmp/ltsmin2097673448152754540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2097673448152754540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16842200042503084065.hoa' '--buchi-type=spotba'
LTSmin run took 177 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-06a-LTLFireability-01 finished in 5414 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)&&G(F((p1||G(p2)))))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 120/121 (removed 1) transitions.
// Phase 1: matrix 120 rows 141 cols
[2024-05-21 08:25:00] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 08:25:00] [INFO ] Implicit Places using invariants in 179 ms returned [7, 21, 28, 35, 46, 51, 115, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 180 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 120/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 118
Applied a total of 4 rules in 3 ms. Remains 131 /133 variables (removed 2) and now considering 118/120 (removed 2) transitions.
// Phase 1: matrix 118 rows 131 cols
[2024-05-21 08:25:00] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 08:25:00] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 08:25:00] [INFO ] Invariant cache hit.
[2024-05-21 08:25:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:25:00] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/142 places, 118/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 432 ms. Remains : 131/142 places, 118/121 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s36 1), p2:(AND (EQ s113 1) (EQ s130 1)), p1:(AND (EQ s13 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-02 finished in 675 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((X((p0||F(G(p1))))||(p1 U (p2||G(p1))))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 142 cols
[2024-05-21 08:25:01] [INFO ] Computed 29 invariants in 6 ms
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants in 140 ms returned [14, 21, 28, 35, 46, 51, 116, 122, 136]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 142 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 121/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 118
Applied a total of 6 rules in 3 ms. Remains 130 /133 variables (removed 3) and now considering 118/121 (removed 3) transitions.
// Phase 1: matrix 118 rows 130 cols
[2024-05-21 08:25:01] [INFO ] Computed 20 invariants in 2 ms
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 08:25:01] [INFO ] Invariant cache hit.
[2024-05-21 08:25:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/142 places, 118/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 407 ms. Remains : 130/142 places, 118/121 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NEQ s37 1) (EQ s7 1) (EQ s81 1)), p1:(AND (EQ s7 1) (EQ s81 1)), p0:(EQ s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-03 finished in 658 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((!p0 U G(p0)))||F(p1)))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 135 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 135 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 134 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 134 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 133 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 133 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 132 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 132 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 131 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 131 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 130 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 130 transition count 109
Applied a total of 24 rules in 20 ms. Remains 130 /142 variables (removed 12) and now considering 109/121 (removed 12) transitions.
// Phase 1: matrix 109 rows 130 cols
[2024-05-21 08:25:01] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants in 91 ms returned [7, 14, 21, 28, 35, 46, 104, 110, 124]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 93 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/142 places, 109/121 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 100
Applied a total of 18 rules in 11 ms. Remains 112 /121 variables (removed 9) and now considering 100/109 (removed 9) transitions.
// Phase 1: matrix 100 rows 112 cols
[2024-05-21 08:25:01] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 08:25:01] [INFO ] Invariant cache hit.
[2024-05-21 08:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 08:25:01] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/142 places, 100/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 315 ms. Remains : 112/142 places, 100/121 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s45 1) (EQ s102 1)), p0:(AND (EQ s25 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-04 finished in 615 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(X((p0 U p1))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 135 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 135 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 134 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 134 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 133 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 133 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 132 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 132 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 131 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 131 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 130 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 130 transition count 109
Applied a total of 24 rules in 20 ms. Remains 130 /142 variables (removed 12) and now considering 109/121 (removed 12) transitions.
// Phase 1: matrix 109 rows 130 cols
[2024-05-21 08:25:02] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:02] [INFO ] Implicit Places using invariants in 111 ms returned [7, 14, 21, 28, 46, 51, 104, 110, 124]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 113 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/142 places, 109/121 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 102
Applied a total of 14 rules in 6 ms. Remains 114 /121 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 114 cols
[2024-05-21 08:25:02] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:25:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 08:25:02] [INFO ] Invariant cache hit.
[2024-05-21 08:25:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 08:25:02] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/142 places, 102/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 114/142 places, 102/121 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (EQ s15 1) (AND (EQ s31 1) (EQ s81 1))), p0:(AND (EQ s32 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 188 steps with 62 reset in 3 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-07 finished in 535 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)&&F(G(p1)))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 142 transition count 99
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 120 transition count 99
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 120 transition count 89
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 110 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 109 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 109 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 108 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 108 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 107 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 107 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 106 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 106 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 105 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 105 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 104 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 104 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 103 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 103 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 102 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 102 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 101 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 101 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 100 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 100 transition count 79
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 112 place count 86 transition count 65
Applied a total of 112 rules in 39 ms. Remains 86 /142 variables (removed 56) and now considering 65/121 (removed 56) transitions.
// Phase 1: matrix 65 rows 86 cols
[2024-05-21 08:25:02] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:02] [INFO ] Implicit Places using invariants in 87 ms returned [5, 12, 17, 22, 27, 32, 33, 34, 35, 36, 37, 38, 39, 65, 70, 81]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 88 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/142 places, 65/121 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 70 transition count 48
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 53 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 52 transition count 47
Applied a total of 36 rules in 5 ms. Remains 52 /70 variables (removed 18) and now considering 47/65 (removed 18) transitions.
// Phase 1: matrix 47 rows 52 cols
[2024-05-21 08:25:02] [INFO ] Computed 13 invariants in 0 ms
[2024-05-21 08:25:03] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 08:25:03] [INFO ] Invariant cache hit.
[2024-05-21 08:25:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 08:25:03] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/142 places, 47/121 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 52/142 places, 47/121 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s41 1)), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-10 finished in 634 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(X(((p0 U !p1)||G(p2)))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 117
Applied a total of 8 rules in 6 ms. Remains 138 /142 variables (removed 4) and now considering 117/121 (removed 4) transitions.
// Phase 1: matrix 117 rows 138 cols
[2024-05-21 08:25:03] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:03] [INFO ] Implicit Places using invariants in 115 ms returned [7, 14, 21, 28, 46, 51, 112, 118]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 116 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/142 places, 117/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 115
Applied a total of 4 rules in 2 ms. Remains 128 /130 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 128 cols
[2024-05-21 08:25:03] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 08:25:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 08:25:03] [INFO ] Invariant cache hit.
[2024-05-21 08:25:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:25:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/142 places, 115/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 329 ms. Remains : 128/142 places, 115/121 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, p1, (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s122 1) (EQ s127 1)), p0:(EQ s39 1), p2:(AND (EQ s31 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 7 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-12 finished in 621 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((p0 U p1)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 142 transition count 102
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 123 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 122 transition count 101
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 40 place count 122 transition count 91
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 60 place count 112 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 111 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 111 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 110 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 110 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 109 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 109 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 108 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 108 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 107 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 107 transition count 86
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 100 place count 92 transition count 71
Applied a total of 100 rules in 26 ms. Remains 92 /142 variables (removed 50) and now considering 71/121 (removed 50) transitions.
// Phase 1: matrix 71 rows 92 cols
[2024-05-21 08:25:04] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:04] [INFO ] Implicit Places using invariants in 344 ms returned [5, 10, 15, 21, 26, 31, 32, 33, 34, 35, 36, 37, 38, 71, 76, 87]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 348 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/142 places, 71/121 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 76 transition count 51
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 56 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 56 transition count 50
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 55 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 53 transition count 48
Applied a total of 46 rules in 8 ms. Remains 53 /76 variables (removed 23) and now considering 48/71 (removed 23) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-21 08:25:04] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 08:25:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 08:25:04] [INFO ] Invariant cache hit.
[2024-05-21 08:25:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-21 08:25:04] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/142 places, 48/121 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 53/142 places, 48/121 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s15 1), p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-13 finished in 615 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 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 134 transition count 77
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 94 place count 91 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 90 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 95 place count 90 transition count 69
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 115 place count 77 transition count 69
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 121 place count 77 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 127 place count 71 transition count 63
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 161 place count 54 transition count 46
Applied a total of 161 rules in 14 ms. Remains 54 /142 variables (removed 88) and now considering 46/121 (removed 75) transitions.
// Phase 1: matrix 46 rows 54 cols
[2024-05-21 08:25:04] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 08:25:04] [INFO ] Implicit Places using invariants in 88 ms returned [40, 43, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 104 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/142 places, 46/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 51/142 places, 46/121 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-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:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-14 finished in 242 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(G(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 135 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 135 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 134 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 134 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 133 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 133 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 132 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 132 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 131 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 131 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 130 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 130 transition count 109
Applied a total of 24 rules in 16 ms. Remains 130 /142 variables (removed 12) and now considering 109/121 (removed 12) transitions.
// Phase 1: matrix 109 rows 130 cols
[2024-05-21 08:25:04] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 08:25:05] [INFO ] Implicit Places using invariants in 198 ms returned [7, 14, 21, 28, 35, 51, 104, 110, 124]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 201 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/142 places, 109/121 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 100
Applied a total of 18 rules in 7 ms. Remains 112 /121 variables (removed 9) and now considering 100/109 (removed 9) transitions.
// Phase 1: matrix 100 rows 112 cols
[2024-05-21 08:25:05] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 08:25:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 08:25:05] [INFO ] Invariant cache hit.
[2024-05-21 08:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 08:25:05] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/142 places, 100/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 112/142 places, 100/121 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s41 1) (EQ s94 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 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLFireability-15 finished in 531 ms.
All properties solved by simple procedures.
Total runtime 14389 ms.

BK_STOP 1716279906628

--------------------
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="AutoFlight-PT-06a"
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 AutoFlight-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180100088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;