Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989900386.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989900386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 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-02a-00
FORMULA_NAME AutoFlight-PT-02a-01
FORMULA_NAME AutoFlight-PT-02a-02
FORMULA_NAME AutoFlight-PT-02a-03
FORMULA_NAME AutoFlight-PT-02a-04
FORMULA_NAME AutoFlight-PT-02a-05
FORMULA_NAME AutoFlight-PT-02a-06
FORMULA_NAME AutoFlight-PT-02a-07
FORMULA_NAME AutoFlight-PT-02a-08
FORMULA_NAME AutoFlight-PT-02a-09
FORMULA_NAME AutoFlight-PT-02a-10
FORMULA_NAME AutoFlight-PT-02a-11
FORMULA_NAME AutoFlight-PT-02a-12
FORMULA_NAME AutoFlight-PT-02a-13
FORMULA_NAME AutoFlight-PT-02a-14
FORMULA_NAME AutoFlight-PT-02a-15

=== Now, execution of the tool begins

BK_START 1620466182225

Running Version 0
[2021-05-08 09:29:43] [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]
[2021-05-08 09:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:29:44] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-08 09:29:44] [INFO ] Transformed 57 places.
[2021-05-08 09:29:44] [INFO ] Transformed 55 transitions.
[2021-05-08 09:29:44] [INFO ] Found NUPN structural information;
[2021-05-08 09:29:44] [INFO ] Parsed PT model containing 57 places and 55 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 09:29:44] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2021-05-08 09:29:44] [INFO ] Computed 16 place invariants in 10 ms
[2021-05-08 09:29:44] [INFO ] Implicit Places using invariants in 110 ms returned [17, 48, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 136 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 54 cols
[2021-05-08 09:29:44] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-08 09:29:44] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 54 cols
[2021-05-08 09:29:44] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-08 09:29:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 45/45 transitions.
[2021-05-08 09:29:44] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 09:29:44] [INFO ] Flatten gal took : 23 ms
FORMULA AutoFlight-PT-02a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:29:44] [INFO ] Flatten gal took : 7 ms
[2021-05-08 09:29:44] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 8262 steps, including 321 resets, run visited all 28 properties in 44 ms. (steps per millisecond=187 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(G(p1))) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 5 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:44] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-08 09:29:44] [INFO ] Implicit Places using invariants in 36 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 37 ms to find 6 implicit places.
// Phase 1: matrix 44 rows 47 cols
[2021-05-08 09:29:44] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-08 09:29:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 9 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:44] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-08 09:29:44] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-02a-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s28 1)), p0:(EQ s8 0), p1:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-02a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-01 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 2 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 40 ms returned [14, 19, 31, 41, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 41 ms to find 5 implicit places.
// Phase 1: matrix 44 rows 48 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 48/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 42
Applied a total of 4 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 46 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 42 rows 46 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 46/54 places, 42/45 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-02a-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s6 1), p0:(AND (EQ s7 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-02 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((F(G(p0)) U p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 2 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 37 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 38 ms to find 6 implicit places.
// Phase 1: matrix 44 rows 47 cols
[2021-05-08 09:29:45] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 9 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:45] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:45] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s27 1)), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-03 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 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 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
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 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 26 place count 41 transition count 32
Applied a total of 26 rules in 15 ms. Remains 41 /54 variables (removed 13) and now considering 32/45 (removed 13) transitions.
// Phase 1: matrix 32 rows 41 cols
[2021-05-08 09:29:45] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 29 ms returned [6, 11, 12, 13, 14, 22, 30, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 30 ms to find 8 implicit places.
[2021-05-08 09:29:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 33 cols
[2021-05-08 09:29:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:29:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 33/54 places, 32/45 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 33 transition count 21
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 22 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 20 transition count 19
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 20 transition count 19
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 28 place count 19 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 18 transition count 29
Applied a total of 30 rules in 9 ms. Remains 18 /33 variables (removed 15) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 18 cols
[2021-05-08 09:29:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 29 rows 18 cols
[2021-05-08 09:29:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/54 places, 29/45 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-04 finished in 152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0&&X(F(p1)))) U ((p1&&X((p0&&X(F(p1)))))||X(G((p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 3 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 29 ms returned [7, 14, 31, 41, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 30 ms to find 5 implicit places.
// Phase 1: matrix 44 rows 48 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-08 09:29:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 48/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 44 transition count 40
Applied a total of 8 rules in 4 ms. Remains 44 /48 variables (removed 4) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 44 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 40 rows 44 cols
[2021-05-08 09:29:45] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:29:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/54 places, 40/45 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02a-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s21 1), p1:(OR (NEQ s17 1) (NEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29366 reset in 243 ms.
Product exploration explored 100000 steps with 29438 reset in 166 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 29459 reset in 131 ms.
Product exploration explored 100000 steps with 29395 reset in 119 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 3 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 44/44 places, 40/40 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 44 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 44 transition count 40
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 44 transition count 40
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 39 transition count 35
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 39 transition count 35
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 39 transition count 35
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 35 transition count 31
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 35 transition count 31
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 36 rules in 7 ms. Remains 35 /44 variables (removed 9) and now considering 31/40 (removed 9) transitions.
[2021-05-08 09:29:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 35 cols
[2021-05-08 09:29:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:47] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/44 places, 31/40 transitions.
Product exploration explored 100000 steps with 30471 reset in 294 ms.
Product exploration explored 100000 steps with 30283 reset in 202 ms.
[2021-05-08 09:29:47] [INFO ] Flatten gal took : 4 ms
[2021-05-08 09:29:47] [INFO ] Flatten gal took : 4 ms
[2021-05-08 09:29:47] [INFO ] Time to serialize gal into /tmp/LTL11520157110675291663.gal : 1 ms
[2021-05-08 09:29:47] [INFO ] Time to serialize properties into /tmp/LTL15337726910148730300.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11520157110675291663.gal, -t, CGAL, -LTL, /tmp/LTL15337726910148730300.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11520157110675291663.gal -t CGAL -LTL /tmp/LTL15337726910148730300.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(p24!=1)")&&(X(F("((p20!=1)||(p53!=1))")))))U((X(G(("(p24!=1)")&&(F("((p20!=1)||(p53!=1))")))))||((X(("(p24!=1)")&&(X(F("((p20!=1)||(p53!=1))")))))&&("((p20!=1)||(p53!=1))")))))
Formula 0 simplified : !(X("(p24!=1)" & XF"((p20!=1)||(p53!=1))") U (XG("(p24!=1)" & F"((p20!=1)||(p53!=1))") | ("((p20!=1)||(p53!=1))" & X("(p24!=1)" & XF"((p20!=1)||(p53!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t9, t15, t31, t35, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/33/7/40
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.068273,19312,1,0,120,9910,116,64,1225,9304,172
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-02a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-02a-05 finished in 1919 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&X((p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 54 cols
[2021-05-08 09:29:47] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:47] [INFO ] Implicit Places using invariants in 81 ms returned [7, 14, 19, 31, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 49 cols
[2021-05-08 09:29:47] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 49/54 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 41 transition count 37
Applied a total of 16 rules in 12 ms. Remains 41 /49 variables (removed 8) and now considering 37/45 (removed 8) transitions.
// Phase 1: matrix 37 rows 41 cols
[2021-05-08 09:29:47] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:47] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 37 rows 41 cols
[2021-05-08 09:29:47] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 41/54 places, 37/45 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-02a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s30 1) (EQ s40 1)), p1:(AND (EQ s12 1) (EQ s36 1)), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-07 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 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 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
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 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 28 place count 40 transition count 31
Applied a total of 28 rules in 6 ms. Remains 40 /54 variables (removed 14) and now considering 31/45 (removed 14) transitions.
// Phase 1: matrix 31 rows 40 cols
[2021-05-08 09:29:48] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:48] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10, 11, 12, 29, 39]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 27 ms to find 6 implicit places.
[2021-05-08 09:29:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 34 cols
[2021-05-08 09:29:48] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 34/54 places, 31/45 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 34 transition count 25
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 28 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 27 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 27 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 24 transition count 21
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 23 transition count 20
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 23 transition count 20
Applied a total of 22 rules in 4 ms. Remains 23 /34 variables (removed 11) and now considering 20/31 (removed 11) transitions.
// Phase 1: matrix 20 rows 23 cols
[2021-05-08 09:29:48] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-08 09:29:48] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 20 rows 23 cols
[2021-05-08 09:29:48] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-08 09:29:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-08 09:29:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/54 places, 20/45 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-02a-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s13 1) (EQ s22 1)), p0:(OR (NEQ s9 1) (NEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
[2021-05-08 09:29:48] [INFO ] Flatten gal took : 2 ms
[2021-05-08 09:29:48] [INFO ] Flatten gal took : 1 ms
[2021-05-08 09:29:48] [INFO ] Time to serialize gal into /tmp/LTL8448145736312379229.gal : 1 ms
[2021-05-08 09:29:48] [INFO ] Time to serialize properties into /tmp/LTL2130457137037243586.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8448145736312379229.gal, -t, CGAL, -LTL, /tmp/LTL2130457137037243586.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8448145736312379229.gal -t CGAL -LTL /tmp/LTL2130457137037243586.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p20==1)&&(p53==1))"))||(F("((p32==1)&&(p55==1))"))))
Formula 0 simplified : !(G"((p20==1)&&(p53==1))" | F"((p32==1)&&(p55==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.014979,16612,1,0,8,1096,28,3,526,479,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-02a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-02a-08 finished in 817 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 1 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:48] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:29:48] [INFO ] Implicit Places using invariants in 40 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
// Phase 1: matrix 44 rows 47 cols
[2021-05-08 09:29:48] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 7 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:49] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-08 09:29:49] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 36 rows 39 cols
[2021-05-08 09:29:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-02a-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s2 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-09 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 1 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:49] [INFO ] Computed 13 place invariants in 8 ms
[2021-05-08 09:29:49] [INFO ] Implicit Places using invariants in 34 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 35 ms to find 6 implicit places.
// Phase 1: matrix 44 rows 47 cols
[2021-05-08 09:29:49] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-08 09:29:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 39/44 (removed 5) transitions.
// Phase 1: matrix 39 rows 42 cols
[2021-05-08 09:29:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:49] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 39 rows 42 cols
[2021-05-08 09:29:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 42/54 places, 39/45 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s21 1), p2:(NEQ s11 1), p1:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25075 reset in 135 ms.
Product exploration explored 100000 steps with 25048 reset in 146 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25066 reset in 105 ms.
Product exploration explored 100000 steps with 24944 reset in 113 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 42/42 places, 39/39 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 42 transition count 39
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 42 transition count 39
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 38 transition count 35
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 38 transition count 35
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 38 transition count 35
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 34 transition count 31
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 34 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 34 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 33 transition count 45
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 33 transition count 45
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 36 rules in 7 ms. Remains 33 /42 variables (removed 9) and now considering 45/39 (removed -6) transitions.
[2021-05-08 09:29:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 33 cols
[2021-05-08 09:29:50] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-08 09:29:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/42 places, 45/39 transitions.
Product exploration explored 100000 steps with 25030 reset in 211 ms.
Product exploration explored 100000 steps with 25035 reset in 182 ms.
[2021-05-08 09:29:50] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:29:50] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:29:50] [INFO ] Time to serialize gal into /tmp/LTL13693017690493788008.gal : 1 ms
[2021-05-08 09:29:50] [INFO ] Time to serialize properties into /tmp/LTL2873882037140394450.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13693017690493788008.gal, -t, CGAL, -LTL, /tmp/LTL2873882037140394450.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13693017690493788008.gal -t CGAL -LTL /tmp/LTL2873882037140394450.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(p25==1)"))||((X("(p0!=1)"))U((("(p12!=1)")&&(X("(p0!=1)")))||(X(G("(p0!=1)")))))))))
Formula 0 simplified : !XG(F"(p25==1)" | (X"(p0!=1)" U (("(p12!=1)" & X"(p0!=1)") | XG"(p0!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t9, t15, t32, t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/32/7/39
Computing Next relation with stutter on 4 deadlock states
23 unique states visited
0 strongly connected components in search stack
24 transitions explored
13 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.083094,20348,1,0,128,14227,124,74,1260,15296,255
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-02a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-02a-10 finished in 1730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 54 cols
[2021-05-08 09:29:50] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:29:50] [INFO ] Implicit Places using invariants in 34 ms returned [7, 14, 19, 31, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
// Phase 1: matrix 45 rows 49 cols
[2021-05-08 09:29:50] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:29:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 49/54 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 41 transition count 37
Applied a total of 16 rules in 6 ms. Remains 41 /49 variables (removed 8) and now considering 37/45 (removed 8) transitions.
// Phase 1: matrix 37 rows 41 cols
[2021-05-08 09:29:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 37 rows 41 cols
[2021-05-08 09:29:51] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 41/54 places, 37/45 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-02a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s30 0) (NEQ s40 0)), p1:(AND (EQ s30 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-11 finished in 307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(F((!p1||G(p2)))&&X((p3 U (p4||G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 1 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:51] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants in 35 ms returned [7, 19, 31, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 49/54 places, 44/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 43
Applied a total of 2 rules in 1 ms. Remains 48 /49 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 48 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 43 rows 48 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:29:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/54 places, 43/45 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND (NOT p3) (NOT p4)), true]
Running random walk in product with property : AutoFlight-PT-02a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p4) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s26 1)), p1:(NEQ s0 1), p2:(EQ s5 1), p4:(AND (OR (NEQ s29 1) (NEQ s47 1)) (NEQ s0 0)), p3:(NEQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-12 finished in 224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((G(p0) U (X(X(p2))&&p1))&&G(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 1 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2021-05-08 09:29:51] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants in 22 ms returned [14, 19, 41, 52]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 49/54 places, 44/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 43
Applied a total of 2 rules in 1 ms. Remains 48 /49 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 48 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 43 rows 48 cols
[2021-05-08 09:29:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:29:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:29:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/54 places, 43/45 transitions.
Stuttering acceptance computed with spot in 616 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-02a-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0 p3), acceptance={1} source=0 dest: 1}, { cond=(AND p1 p0 p3), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={0, 1} source=0 dest: 5}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=0 dest: 6}], [{ cond=(AND p1 p0 p3), acceptance={1} source=1 dest: 7}, { cond=(AND p1 p0 p3), acceptance={} source=1 dest: 8}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3))), acceptance={1} source=1 dest: 9}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=1 dest: 10}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=1 dest: 11}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=1 dest: 12}], [{ cond=(AND p1 p0), acceptance={1} source=2 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 10}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 12}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 13}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 14}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 0}, { cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 p0 p3), acceptance={1} source=4 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3))), acceptance={1} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=4 dest: 6}, { cond=(AND p1 p0 p3), acceptance={} source=4 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=5 dest: 6}], [{ cond=(AND p1 p0 p3), acceptance={1} source=6 dest: 7}, { cond=(AND (NOT p1) p0 p3), acceptance={1} source=6 dest: 9}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=6 dest: 10}, { cond=(OR (AND p1 p3) (AND p0 p3)), acceptance={0} source=6 dest: 11}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p3)), acceptance={0, 1} source=6 dest: 12}, { cond=(AND p1 p0 p3), acceptance={0, 1} source=6 dest: 13}, { cond=(AND (NOT p1) p0 p3), acceptance={0, 1} source=6 dest: 14}], [{ cond=(AND p1 p0 p3 (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=7 dest: 9}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=7 dest: 10}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0} source=7 dest: 11}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=8 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=8 dest: 15}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={1} source=9 dest: 1}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=9 dest: 4}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=9 dest: 6}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={} source=9 dest: 15}], [{ cond=(AND p1 p0 p3 (NOT p2)), acceptance={1} source=10 dest: 7}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={1} source=10 dest: 9}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=10 dest: 10}, { cond=(OR (AND p1 p3 (NOT p2)) (AND p0 p3 (NOT p2))), acceptance={0} source=10 dest: 11}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=10 dest: 12}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={0, 1} source=10 dest: 13}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0, 1} source=10 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=11 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=11 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=12 dest: 0}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={1} source=12 dest: 1}, { cond=(AND p1 p0 p3 (NOT p2)), acceptance={0, 1} source=12 dest: 2}, { cond=(OR (AND p1 p3 (NOT p2)) (AND p0 p3 (NOT p2))), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={1} source=12 dest: 4}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0, 1} source=12 dest: 5}, { cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=12 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={1} source=13 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=13 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=13 dest: 10}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=13 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=13 dest: 13}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=13 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=14 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=14 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=14 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=14 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=14 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=15 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=15 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={1} source=15 dest: 4}, { cond=(AND p0 p3), acceptance={} source=15 dest: 15}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s47 1)), p0:(EQ s34 1), p3:(AND (EQ s7 1) (EQ s35 1)), p2:(OR (EQ s8 0) (EQ s28 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-14 finished in 758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0&&(F(!p1)||G(p2))) U p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 45/45 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 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 50 transition count 38
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 14 place count 47 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 46 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 46 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 22 place count 43 transition count 34
Applied a total of 22 rules in 6 ms. Remains 43 /54 variables (removed 11) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 43 cols
[2021-05-08 09:29:52] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:29:52] [INFO ] Implicit Places using invariants in 23 ms returned [6, 14, 15, 23, 31, 42]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 24 ms to find 6 implicit places.
[2021-05-08 09:29:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 37 cols
[2021-05-08 09:29:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 37/54 places, 34/45 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 4 rules applied. Total rules applied 4 place count 37 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 33 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 33 transition count 28
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 12 place count 31 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 29 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 29 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 28 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 28 transition count 25
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 20 place count 27 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 22 place count 26 transition count 32
Applied a total of 22 rules in 6 ms. Remains 26 /37 variables (removed 11) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 26 cols
[2021-05-08 09:29:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:52] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 32 rows 26 cols
[2021-05-08 09:29:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:29:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-08 09:29:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/54 places, 32/45 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02a-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s14 1)), p0:(OR (EQ s3 0) (EQ s11 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-15 finished in 170 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620466193201

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-02a"
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-02a, 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 r007-tall-162037989900386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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