fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597900404
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutoFlight-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.411 23044.00 46028.00 116.50 F??FFFFFFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678627128941

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:18:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:18:52] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-12 13:18:52] [INFO ] Transformed 82 places.
[2023-03-12 13:18:52] [INFO ] Transformed 80 transitions.
[2023-03-12 13:18:52] [INFO ] Found NUPN structural information;
[2023-03-12 13:18:52] [INFO ] Parsed PT model containing 82 places and 80 transitions and 260 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
FORMULA AutoFlight-PT-03a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 27 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2023-03-12 13:18:53] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-12 13:18:53] [INFO ] Implicit Places using invariants in 395 ms returned [27, 47, 67, 79]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 468 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/82 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 64
Applied a total of 2 rules in 4 ms. Remains 77 /78 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 77 cols
[2023-03-12 13:18:53] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-12 13:18:53] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 13:18:53] [INFO ] Invariant cache hit.
[2023-03-12 13:18:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:18:53] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 77/82 places, 64/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 801 ms. Remains : 77/82 places, 64/65 transitions.
Support contains 34 out of 77 places after structural reductions.
[2023-03-12 13:18:54] [INFO ] Flatten gal took : 57 ms
[2023-03-12 13:18:54] [INFO ] Flatten gal took : 11 ms
[2023-03-12 13:18:54] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 363 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-12 13:18:54] [INFO ] Invariant cache hit.
[2023-03-12 13:18:54] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-12 13:18:54] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 13:18:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2023-03-12 13:18:54] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-03a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1 U p2))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 70 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 65 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 64 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 64 transition count 51
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 58 transition count 45
Applied a total of 38 rules in 36 ms. Remains 58 /77 variables (removed 19) and now considering 45/64 (removed 19) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-12 13:18:55] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-12 13:18:55] [INFO ] Implicit Places using invariants in 174 ms returned [5, 15, 16, 17, 18, 21, 42, 57]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 177 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/77 places, 45/64 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 43
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 48 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 45 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 45 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 20 place count 40 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 39 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 39 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 38 transition count 33
Applied a total of 24 rules in 9 ms. Remains 38 /50 variables (removed 12) and now considering 33/45 (removed 12) transitions.
// Phase 1: matrix 33 rows 38 cols
[2023-03-12 13:18:55] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 13:18:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 13:18:55] [INFO ] Invariant cache hit.
[2023-03-12 13:18:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 13:18:55] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/77 places, 33/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 38/77 places, 33/64 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s15 1), p1:(AND (EQ s9 1) (EQ s22 1)), p0:(AND (EQ s33 1) (EQ s37 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 11 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-00 finished in 934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((G(p2) U p3)&&p1)||p0))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 70 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 64 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 63 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 63 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 58 transition count 45
Applied a total of 38 rules in 8 ms. Remains 58 /77 variables (removed 19) and now considering 45/64 (removed 19) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-12 13:18:56] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:18:56] [INFO ] Implicit Places using invariants in 140 ms returned [11, 16, 17, 18, 19, 20, 21, 42, 51, 57]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 144 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/77 places, 45/64 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 48 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 40 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 40 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 36 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 34 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 34 transition count 31
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 30 place count 33 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 32 transition count 49
Applied a total of 32 rules in 19 ms. Remains 32 /48 variables (removed 16) and now considering 49/45 (removed -4) transitions.
// Phase 1: matrix 49 rows 32 cols
[2023-03-12 13:18:56] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 13:18:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 13:18:56] [INFO ] Invariant cache hit.
[2023-03-12 13:18:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 13:18:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/77 places, 49/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 32/77 places, 49/64 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s6 1) (EQ s15 1)), p0:(OR (EQ s3 0) (EQ s26 0)), p2:(AND (EQ s3 1) (EQ s26 1)), p1:(AND (EQ s3 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 6643 reset in 375 ms.
Product exploration explored 100000 steps with 6685 reset in 217 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p1 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p1) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 713 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 663 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:18:58] [INFO ] Invariant cache hit.
[2023-03-12 13:18:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:18:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 13:18:58] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p1 (NOT p0) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p1))))), (G (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p1) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (F (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p0) (NOT p1)))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 1240 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-12 13:19:00] [INFO ] Invariant cache hit.
[2023-03-12 13:19:00] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 13:19:00] [INFO ] Invariant cache hit.
[2023-03-12 13:19:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 13:19:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-12 13:19:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:19:00] [INFO ] Invariant cache hit.
[2023-03-12 13:19:00] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 32/32 places, 49/49 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 52 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 6718 reset in 209 ms.
Product exploration explored 100000 steps with 6827 reset in 306 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-12 13:19:02] [INFO ] Invariant cache hit.
[2023-03-12 13:19:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 13:19:02] [INFO ] Invariant cache hit.
[2023-03-12 13:19:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 13:19:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-12 13:19:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:19:02] [INFO ] Invariant cache hit.
[2023-03-12 13:19:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 32/32 places, 49/49 transitions.
Treatment of property AutoFlight-PT-03a-LTLFireability-01 finished in 6385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 71 transition count 44
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 43 place count 52 transition count 44
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 52 transition count 37
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 60 place count 42 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 60 place count 42 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 39 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 38 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 38 transition count 33
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 31 transition count 26
Applied a total of 82 rules in 5 ms. Remains 31 /77 variables (removed 46) and now considering 26/64 (removed 38) transitions.
// Phase 1: matrix 26 rows 31 cols
[2023-03-12 13:19:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 13:19:02] [INFO ] Implicit Places using invariants in 50 ms returned [20, 26, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/77 places, 26/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 24
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 24
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 0 with 2 rules applied. Total rules applied 6 place count 25 transition count 23
Applied a total of 6 rules in 2 ms. Remains 25 /28 variables (removed 3) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 25 cols
[2023-03-12 13:19:02] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 13:19:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 13:19:02] [INFO ] Invariant cache hit.
[2023-03-12 13:19:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/77 places, 23/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 25/77 places, 23/64 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-02 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 s0 0) (EQ s12 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8331 reset in 166 ms.
Product exploration explored 100000 steps with 8367 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 88 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 23/23 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-12 13:19:04] [INFO ] Invariant cache hit.
[2023-03-12 13:19:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 13:19:04] [INFO ] Invariant cache hit.
[2023-03-12 13:19:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-12 13:19:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:19:04] [INFO ] Invariant cache hit.
[2023-03-12 13:19:04] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 25/25 places, 23/23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8322 reset in 125 ms.
Product exploration explored 100000 steps with 8316 reset in 151 ms.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-12 13:19:05] [INFO ] Invariant cache hit.
[2023-03-12 13:19:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 13:19:05] [INFO ] Invariant cache hit.
[2023-03-12 13:19:05] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-12 13:19:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 13:19:05] [INFO ] Invariant cache hit.
[2023-03-12 13:19:05] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 25/25 places, 23/23 transitions.
Treatment of property AutoFlight-PT-03a-LTLFireability-02 finished in 3392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 70 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 64 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 63 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 63 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 57 transition count 44
Applied a total of 40 rules in 15 ms. Remains 57 /77 variables (removed 20) and now considering 44/64 (removed 20) transitions.
// Phase 1: matrix 44 rows 57 cols
[2023-03-12 13:19:05] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:19:06] [INFO ] Implicit Places using invariants in 319 ms returned [10, 15, 16, 18, 19, 20, 41, 50, 56]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 335 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/77 places, 44/64 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 38
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 42 transition count 38
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 42 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 37 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 35 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 35 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 34 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 34 transition count 30
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 30 place count 33 transition count 29
Applied a total of 30 rules in 4 ms. Remains 33 /48 variables (removed 15) and now considering 29/44 (removed 15) transitions.
// Phase 1: matrix 29 rows 33 cols
[2023-03-12 13:19:06] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-12 13:19:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 13:19:06] [INFO ] Invariant cache hit.
[2023-03-12 13:19:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 13:19:06] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/77 places, 29/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 702 ms. Remains : 33/77 places, 29/64 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s14 1) (EQ s27 1)), p0:(AND (EQ s5 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-05 finished in 913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 70 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 65 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 64 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 64 transition count 51
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 58 transition count 45
Applied a total of 38 rules in 14 ms. Remains 58 /77 variables (removed 19) and now considering 45/64 (removed 19) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-12 13:19:06] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-12 13:19:06] [INFO ] Implicit Places using invariants in 107 ms returned [5, 10, 15, 16, 17, 20, 42, 51, 57]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 122 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/77 places, 45/64 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 49 transition count 32
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 36 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 36 transition count 31
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 28 place count 35 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 33 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 33 transition count 29
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 36 place count 31 transition count 27
Applied a total of 36 rules in 3 ms. Remains 31 /49 variables (removed 18) and now considering 27/45 (removed 18) transitions.
// Phase 1: matrix 27 rows 31 cols
[2023-03-12 13:19:07] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-12 13:19:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 13:19:07] [INFO ] Invariant cache hit.
[2023-03-12 13:19:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 13:19:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/77 places, 27/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 31/77 places, 27/64 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-06 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 s14 0) (OR (EQ s15 0) (EQ s29 0))), p1:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8273 reset in 161 ms.
Stack based approach found an accepted trace after 5507 steps with 474 reset with depth 6 and stack size 6 in 7 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-06 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(F(p2)))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 63
Applied a total of 2 rules in 16 ms. Remains 76 /77 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 76 cols
[2023-03-12 13:19:07] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:19:07] [INFO ] Implicit Places using invariants in 118 ms returned [7, 14, 21, 24, 29, 59, 69, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 120 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/77 places, 63/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 57 transition count 52
Applied a total of 22 rules in 9 ms. Remains 57 /68 variables (removed 11) and now considering 52/63 (removed 11) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-12 13:19:07] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 13:19:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 13:19:07] [INFO ] Invariant cache hit.
[2023-03-12 13:19:07] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/77 places, 52/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 57/77 places, 52/64 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s14 1), p0:(EQ s20 1), p2:(EQ s5 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 85 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-09 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 63
Applied a total of 2 rules in 16 ms. Remains 76 /77 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 76 cols
[2023-03-12 13:19:08] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-12 13:19:08] [INFO ] Implicit Places using invariants in 102 ms returned [7, 14, 21, 24, 29, 59, 69, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/77 places, 63/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 57 transition count 52
Applied a total of 22 rules in 8 ms. Remains 57 /68 variables (removed 11) and now considering 52/63 (removed 11) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-12 13:19:08] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 13:19:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 13:19:08] [INFO ] Invariant cache hit.
[2023-03-12 13:19:08] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/77 places, 52/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 57/77 places, 52/64 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s19 1) (EQ s46 1)), p0:(EQ s9 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]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03a-LTLFireability-10 finished in 842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(G(p1)))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 63
Applied a total of 2 rules in 5 ms. Remains 76 /77 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 76 cols
[2023-03-12 13:19:09] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:19:09] [INFO ] Implicit Places using invariants in 124 ms returned [7, 14, 21, 24, 29, 59, 69, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 126 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/77 places, 63/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 57 transition count 52
Applied a total of 22 rules in 15 ms. Remains 57 /68 variables (removed 11) and now considering 52/63 (removed 11) transitions.
// Phase 1: matrix 52 rows 57 cols
[2023-03-12 13:19:09] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 13:19:09] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-12 13:19:09] [INFO ] Invariant cache hit.
[2023-03-12 13:19:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/77 places, 52/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 443 ms. Remains : 57/77 places, 52/64 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s24 1), p1:(AND (EQ s18 1) (EQ s9 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-13 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 77 cols
[2023-03-12 13:19:09] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 13:19:09] [INFO ] Implicit Places using invariants in 107 ms returned [7, 14, 21, 24, 29, 69]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 109 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/77 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 63
Applied a total of 2 rules in 2 ms. Remains 70 /71 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 70 cols
[2023-03-12 13:19:09] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 13:19:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 13:19:09] [INFO ] Invariant cache hit.
[2023-03-12 13:19:10] [INFO ] Implicit Places using invariants and state equation in 128 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 : 70/77 places, 63/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 70/77 places, 63/64 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s63 1) (NEQ s69 1) (AND (EQ s7 1) (EQ s39 1))), p1:(OR (EQ s54 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28902 steps with 1025 reset in 84 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-14 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((G(p2) U p3)&&p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 13:19:11] [INFO ] Flatten gal took : 7 ms
[2023-03-12 13:19:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 13:19:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 64 transitions and 215 arcs took 1 ms.
Total runtime 18459 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1103/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1103/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-03a-LTLFireability-01
Could not compute solution for formula : AutoFlight-PT-03a-LTLFireability-02

BK_STOP 1678627151985

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-03a-LTLFireability-01
ltl formula formula --ltl=/tmp/1103/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 64 transitions and 215 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1103/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1103/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1103/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1103/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutoFlight-PT-03a-LTLFireability-02
ltl formula formula --ltl=/tmp/1103/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 64 transitions and 215 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1103/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1103/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1103/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1103/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-03a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597900404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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