Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.7K Apr 30 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 8.7K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652660134211

Running Version 202205111006
[2022-05-16 00:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:15:35] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 00:15:35] [INFO ] Transformed 32 places.
[2022-05-16 00:15:35] [INFO ] Transformed 30 transitions.
[2022-05-16 00:15:35] [INFO ] Found NUPN structural information;
[2022-05-16 00:15:35] [INFO ] Parsed PT model containing 32 places and 30 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA AutoFlight-PT-01a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 9 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 32 cols
[2022-05-16 00:15:35] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 00:15:35] [INFO ] Implicit Places using invariants in 117 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 25/25 transitions.
Support contains 23 out of 31 places after structural reductions.
[2022-05-16 00:15:36] [INFO ] Flatten gal took : 18 ms
[2022-05-16 00:15:36] [INFO ] Flatten gal took : 5 ms
[2022-05-16 00:15:36] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 3486 steps, including 131 resets, run visited all 26 properties in 147 ms. (steps per millisecond=23 )
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(G(p2)&&p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:15:36] [INFO ] Implicit Places using invariants in 56 ms returned [10, 17, 28, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 24 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 24 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 23 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 23 transition count 21
Applied a total of 8 rules in 6 ms. Remains 23 /27 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 00:15:36] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:15:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/31 places, 21/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/31 places, 21/25 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s16 1)), p2:(NEQ s6 1), p0:(OR (NEQ s7 1) (NEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-00 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 28 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 24 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 24 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 19 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 19 transition count 15
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 21 place count 18 transition count 15
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 23 place count 17 transition count 14
Applied a total of 23 rules in 11 ms. Remains 17 /31 variables (removed 14) and now considering 14/25 (removed 11) transitions.
// Phase 1: matrix 14 rows 17 cols
[2022-05-16 00:15:37] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 28 ms returned [8, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/31 places, 14/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 13
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 13
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 14 cols
[2022-05-16 00:15:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 13 rows 14 cols
[2022-05-16 00:15:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/31 places, 13/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/31 places, 13/25 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 0) (OR (EQ s5 0) (EQ s13 0))), p1:(AND (EQ s5 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-02 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 43 ms returned [7, 10, 17, 28, 30]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/31 places, 25/25 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 21 transition count 20
Applied a total of 10 rules in 4 ms. Remains 21 /26 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 21 cols
[2022-05-16 00:15:37] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2022-05-16 00:15:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/31 places, 20/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/31 places, 20/25 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-03 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:(EQ s0 0), p0:(EQ s2 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 206 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/21 stabilizing places and 1/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-01a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01a-LTLFireability-03 finished in 626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F((p1 U p2))&&(p1 U p3))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 23
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 4 place count 29 transition count 23
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 8 place count 27 transition count 21
Applied a total of 8 rules in 4 ms. Remains 27 /31 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 27 cols
[2022-05-16 00:15:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 30 ms returned [8, 24, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/31 places, 21/25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 20
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 22 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 22 transition count 19
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 22 cols
[2022-05-16 00:15:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 00:15:37] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 19 rows 22 cols
[2022-05-16 00:15:37] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 00:15:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/31 places, 19/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/31 places, 19/25 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=0 dest: 5}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p0 p1 (NOT p2))), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s7 0), p3:(AND (EQ s12 1) (EQ s21 1)), p1:(AND (EQ s5 1) (EQ s14 1)), p2:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-04 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U (F(X(!G(F(p1))))&&!p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 30 transition count 21
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 8 place count 27 transition count 21
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 10 place count 26 transition count 20
Applied a total of 10 rules in 4 ms. Remains 26 /31 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 26 cols
[2022-05-16 00:15:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants in 49 ms returned [6, 7, 8, 13, 23, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 51 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 20/25 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 20 transition count 14
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 14 transition count 14
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 12 transition count 12
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 12 transition count 12
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 18 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 10 transition count 16
Applied a total of 20 rules in 4 ms. Remains 10 /20 variables (removed 10) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 00:15:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 00:15:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 00:15:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/31 places, 16/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/31 places, 16/25 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s5 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 44 steps with 12 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-05 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(G(p1))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:38] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants in 35 ms returned [7, 10, 17, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 25 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 25 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 24 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 24 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 23 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 23 transition count 21
Applied a total of 8 rules in 3 ms. Remains 23 /27 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/31 places, 21/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/31 places, 21/25 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-07 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=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s22 0)), p1:(OR (NEQ s16 1) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4220 reset in 151 ms.
Product exploration explored 100000 steps with 4121 reset in 177 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 7946 steps, including 334 resets, run visited all 3 properties in 253 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0), (NOT p1)]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:40] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 21/21 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 2095 steps, including 88 resets, run visited all 3 properties in 43 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4164 reset in 66 ms.
Product exploration explored 100000 steps with 4168 reset in 79 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (NOT p1)]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 21/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 23 transition count 22
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 23 transition count 22
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 21 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 21 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 4 ms. Remains 21 /23 variables (removed 2) and now considering 20/21 (removed 1) transitions.
[2022-05-16 00:15:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2022-05-16 00:15:41] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 00:15:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/23 places, 20/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 20/21 transitions.
Product exploration explored 100000 steps with 7040 reset in 192 ms.
Stack based approach found an accepted trace after 1849 steps with 126 reset with depth 6 and stack size 5 in 5 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-07 finished in 3415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U p1)&&X(p2)&&X(p3)&&p4)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:41] [INFO ] Implicit Places using invariants in 42 ms returned [7, 10, 17, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 24
Applied a total of 2 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 26 cols
[2022-05-16 00:15:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:41] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 24 rows 26 cols
[2022-05-16 00:15:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/31 places, 24/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/31 places, 24/25 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p4) (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), p1]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p4) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p4 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p4 p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p4 (NOT p1) (NOT p2)) (AND p4 (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p4 p0 (NOT p1) (NOT p2)) (AND p4 p0 (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p4:(EQ s3 0), p1:(EQ s12 1), p0:(AND (EQ s9 1) (EQ s25 1)), p2:(EQ s12 0), p3:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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 p4 (NOT p1) (NOT p0) p2 p3), (X (OR (NOT p4) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p4 (NOT p1)))), (X (NOT (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND p4 p0 (NOT p1) (NOT p3))))), (X (NOT (OR (AND p4 (NOT p1) (NOT p2)) (AND p4 (NOT p1) (NOT p3))))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p4) (NOT p2)) (AND (NOT p4) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3)))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND p4 p0 (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND p4 (NOT p1) (NOT p2)) (AND p4 (NOT p1) (NOT p3)))))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (OR (NOT p4) p1))), (X (X (NOT (OR (NOT p4) p1)))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p4 (NOT p1) (NOT p0) p2 p3)
Knowledge based reduction with 15 factoid took 641 ms. Reduced automaton from 3 states, 8 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-01a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01a-LTLFireability-09 finished in 1182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(((F(X(p0))||F(p1))&&p2)) U p3))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants in 44 ms returned [17, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 28 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 24
Applied a total of 2 rules in 2 ms. Remains 28 /29 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 28 cols
[2022-05-16 00:15:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 24 rows 28 cols
[2022-05-16 00:15:43] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 00:15:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 28/31 places, 24/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 28/31 places, 24/25 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p3), true, (AND (NOT p2) p1), p0, (OR (AND p0 p2) (AND p1 p2))]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1))), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s21 1) (EQ s27 1)), p2:(EQ s18 1), p1:(AND (EQ s7 1) (EQ s17 1)), p0:(AND (EQ s10 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-10 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(G(p0))||p1)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants in 37 ms returned [7, 10, 17, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 25 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 25 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 24 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 24 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 23 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 23 transition count 21
Applied a total of 8 rules in 9 ms. Remains 23 /27 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 21 rows 23 cols
[2022-05-16 00:15:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:43] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/31 places, 21/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/31 places, 21/25 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s14 0)), p1:(AND (EQ s21 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-01a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01a-LTLFireability-11 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X(p0) U (p1 U p2)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 36 ms returned [10, 17, 28, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 23
Applied a total of 4 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 25 cols
[2022-05-16 00:15:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 23 rows 25 cols
[2022-05-16 00:15:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:15:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 25/31 places, 23/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 25/31 places, 23/25 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ 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=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s7 1) (EQ s11 1)), p1:(NEQ s2 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-12 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0 U X((G(X(p1))||p2)))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 37 ms returned [7, 10, 17, 28, 30]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/31 places, 25/25 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 21 transition count 20
Applied a total of 10 rules in 2 ms. Remains 21 /26 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 21 cols
[2022-05-16 00:15:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2022-05-16 00:15:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/31 places, 20/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/31 places, 20/25 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(NOT p2), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s6 1), p2:(AND (EQ s1 1) (EQ s14 1)), p1:(EQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-13 finished in 432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(p0)) U p1))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 31 cols
[2022-05-16 00:15:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 48 ms returned [7, 10, 28, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/31 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 24
Applied a total of 2 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 26 cols
[2022-05-16 00:15:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 24 rows 26 cols
[2022-05-16 00:15:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:15:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/31 places, 24/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/31 places, 24/25 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 92 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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-01a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01a-LTLFireability-14 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(F((G(p0)||p1)))))&&F(p1)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 25/25 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 30 transition count 21
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 8 place count 27 transition count 21
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 10 place count 26 transition count 20
Applied a total of 10 rules in 10 ms. Remains 26 /31 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 26 cols
[2022-05-16 00:15:45] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 00:15:45] [INFO ] Implicit Places using invariants in 72 ms returned [6, 7, 8, 13, 23, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 75 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 20/25 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 20 transition count 14
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 14 transition count 14
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 12 transition count 12
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 12 transition count 12
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 18 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 10 transition count 16
Applied a total of 20 rules in 51 ms. Remains 10 /20 variables (removed 10) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 00:15:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 00:15:45] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 00:15:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 00:15:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 00:15:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/31 places, 16/25 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/31 places, 16/25 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-01a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2 1), p0:(OR (EQ s3 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-LTLFireability-15 finished in 356 ms.
All properties solved by simple procedures.
Total runtime 10166 ms.

BK_STOP 1652660145831

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-01a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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