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-162037990000410.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-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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 3.6K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 14K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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.7K 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 70K 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-03b-00
FORMULA_NAME AutoFlight-PT-03b-01
FORMULA_NAME AutoFlight-PT-03b-02
FORMULA_NAME AutoFlight-PT-03b-03
FORMULA_NAME AutoFlight-PT-03b-04
FORMULA_NAME AutoFlight-PT-03b-05
FORMULA_NAME AutoFlight-PT-03b-06
FORMULA_NAME AutoFlight-PT-03b-07
FORMULA_NAME AutoFlight-PT-03b-08
FORMULA_NAME AutoFlight-PT-03b-09
FORMULA_NAME AutoFlight-PT-03b-10
FORMULA_NAME AutoFlight-PT-03b-11
FORMULA_NAME AutoFlight-PT-03b-12
FORMULA_NAME AutoFlight-PT-03b-13
FORMULA_NAME AutoFlight-PT-03b-14
FORMULA_NAME AutoFlight-PT-03b-15

=== Now, execution of the tool begins

BK_START 1620467222154

Running Version 0
[2021-05-08 09:47:04] [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:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:47:04] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-08 09:47:04] [INFO ] Transformed 298 places.
[2021-05-08 09:47:04] [INFO ] Transformed 296 transitions.
[2021-05-08 09:47:04] [INFO ] Found NUPN structural information;
[2021-05-08 09:47:04] [INFO ] Parsed PT model containing 298 places and 296 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 09:47:04] [INFO ] Initial state test concluded for 2 properties.
Support contains 39 out of 298 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 266 transition count 264
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 266 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 266 transition count 261
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 251 transition count 246
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 251 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 249 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 249 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 248 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 248 transition count 243
Applied a total of 103 rules in 80 ms. Remains 248 /298 variables (removed 50) and now considering 243/296 (removed 53) transitions.
// Phase 1: matrix 243 rows 248 cols
[2021-05-08 09:47:04] [INFO ] Computed 22 place invariants in 22 ms
[2021-05-08 09:47:04] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 243 rows 248 cols
[2021-05-08 09:47:04] [INFO ] Computed 22 place invariants in 11 ms
[2021-05-08 09:47:04] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 248 cols
[2021-05-08 09:47:04] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-08 09:47:05] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 1 iterations. Remains : 248/298 places, 243/296 transitions.
[2021-05-08 09:47:05] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-08 09:47:05] [INFO ] Flatten gal took : 52 ms
FORMULA AutoFlight-PT-03b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:47:05] [INFO ] Flatten gal took : 20 ms
[2021-05-08 09:47:05] [INFO ] Input system was already deterministic with 243 transitions.
Incomplete random walk after 100000 steps, including 627 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 24) seen :20
Running SMT prover for 4 properties.
// Phase 1: matrix 243 rows 248 cols
[2021-05-08 09:47:05] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:05] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned unsat
[2021-05-08 09:47:05] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2021-05-08 09:47:05] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-08 09:47:05] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2021-05-08 09:47:06] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2021-05-08 09:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2021-05-08 09:47:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:47:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 37 ms returned sat
[2021-05-08 09:47:06] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 09:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:06] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-08 09:47:06] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2021-05-08 09:47:06] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2021-05-08 09:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2021-05-08 09:47:06] [INFO ] Computed and/alt/rep : 242/342/242 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2021-05-08 09:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-08 09:47:07] [INFO ] Added : 242 causal constraints over 49 iterations in 907 ms. Result :sat
[2021-05-08 09:47:07] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2021-05-08 09:47:07] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 09:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:07] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2021-05-08 09:47:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2021-05-08 09:47:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:47:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2021-05-08 09:47:07] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 09:47:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:07] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2021-05-08 09:47:07] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2021-05-08 09:47:08] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2021-05-08 09:47:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2021-05-08 09:47:08] [INFO ] Computed and/alt/rep : 242/342/242 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-08 09:47:08] [INFO ] Deduced a trap composed of 54 places in 32 ms of which 1 ms to minimize.
[2021-05-08 09:47:08] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2021-05-08 09:47:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2021-05-08 09:47:08] [INFO ] Added : 232 causal constraints over 47 iterations in 760 ms. Result :sat
[2021-05-08 09:47:08] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-08 09:47:08] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:08] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-08 09:47:08] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2021-05-08 09:47:08] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 54 places in 30 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 352 ms
[2021-05-08 09:47:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:47:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2021-05-08 09:47:09] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 09:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:47:09] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 1 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2021-05-08 09:47:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 378 ms
[2021-05-08 09:47:09] [INFO ] Computed and/alt/rep : 242/342/242 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-08 09:47:10] [INFO ] Added : 242 causal constraints over 49 iterations in 708 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 247 transition count 156
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 98 rules applied. Total rules applied 184 place count 161 transition count 144
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 190 place count 155 transition count 144
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 190 place count 155 transition count 114
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 250 place count 125 transition count 114
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 257 place count 118 transition count 107
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 118 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 264 place count 118 transition count 104
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 270 place count 115 transition count 104
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 358 place count 71 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 70 transition count 53
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 368 place count 64 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 371 place count 61 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 371 place count 61 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 377 place count 58 transition count 47
Applied a total of 377 rules in 51 ms. Remains 58 /248 variables (removed 190) and now considering 47/243 (removed 196) transitions.
// Phase 1: matrix 47 rows 58 cols
[2021-05-08 09:47:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:47:10] [INFO ] Implicit Places using invariants in 29 ms returned [21, 32, 43, 47, 52, 57]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 30 ms to find 6 implicit places.
[2021-05-08 09:47:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 52 cols
[2021-05-08 09:47:10] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:47:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 52/248 places, 47/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 48 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 48 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 47 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 47 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 46 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 46 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 45 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 45 transition count 40
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 16 place count 44 transition count 39
Applied a total of 16 rules in 6 ms. Remains 44 /52 variables (removed 8) and now considering 39/47 (removed 8) transitions.
// Phase 1: matrix 39 rows 44 cols
[2021-05-08 09:47:10] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:47:10] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 39 rows 44 cols
[2021-05-08 09:47:10] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:47:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/248 places, 39/243 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6823 reset in 254 ms.
Product exploration explored 100000 steps with 6833 reset in 164 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6810 reset in 128 ms.
Product exploration explored 100000 steps with 6822 reset in 180 ms.
[2021-05-08 09:47:11] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:47:11] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:47:11] [INFO ] Time to serialize gal into /tmp/LTL14363765604058728911.gal : 1 ms
[2021-05-08 09:47:11] [INFO ] Time to serialize properties into /tmp/LTL16607447592569049559.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/LTL14363765604058728911.gal, -t, CGAL, -LTL, /tmp/LTL16607447592569049559.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/LTL14363765604058728911.gal -t CGAL -LTL /tmp/LTL16607447592569049559.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p263!=1)"))))
Formula 0 simplified : !GF"(p263!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 96 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 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.03267,17008,1,0,27,4047,24,15,1040,2818,65
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03b-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-03b-01 finished in 1265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(p0))&&(p1||((p2||X(!p1)) U p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 240 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 240 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 240 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 237 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 237 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 236 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 235 transition count 228
Applied a total of 28 rules in 17 ms. Remains 235 /248 variables (removed 13) and now considering 228/243 (removed 15) transitions.
// Phase 1: matrix 228 rows 235 cols
[2021-05-08 09:47:11] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:11] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 228 rows 235 cols
[2021-05-08 09:47:11] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 235 cols
[2021-05-08 09:47:11] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:12] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/248 places, 228/243 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), p1, (NOT p0), (NOT p3), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(EQ s44 1), p3:(EQ s62 1), p2:(EQ s67 0), p0:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-03 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0)&&F(G(p1)))) U G((p2 U p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 247 transition count 162
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 91 rules applied. Total rules applied 171 place count 167 transition count 151
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 181 place count 161 transition count 147
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 186 place count 157 transition count 146
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 186 place count 157 transition count 115
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 248 place count 126 transition count 115
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 255 place count 119 transition count 108
Iterating global reduction 4 with 7 rules applied. Total rules applied 262 place count 119 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 262 place count 119 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 118 transition count 107
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 352 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 73 transition count 56
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 362 place count 67 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 365 place count 64 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 365 place count 64 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 371 place count 61 transition count 50
Applied a total of 371 rules in 21 ms. Remains 61 /248 variables (removed 187) and now considering 50/243 (removed 193) transitions.
// Phase 1: matrix 50 rows 61 cols
[2021-05-08 09:47:12] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:47:12] [INFO ] Implicit Places using invariants in 30 ms returned [25, 36, 47, 51, 55, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 30 ms to find 6 implicit places.
[2021-05-08 09:47:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 55 cols
[2021-05-08 09:47:12] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:47:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 55/248 places, 50/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 50 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 50 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 49 transition count 44
Applied a total of 12 rules in 4 ms. Remains 49 /55 variables (removed 6) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 09:47:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:47:12] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 09:47:12] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:47:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 49/248 places, 44/243 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p3), (NOT p0), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p0) p3) (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-03b-05 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p3 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p3 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s17 1) (EQ s34 1)), p2:(EQ s5 1), p0:(EQ s2 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-05 finished in 317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 238 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 238 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 233 transition count 225
Applied a total of 33 rules in 16 ms. Remains 233 /248 variables (removed 15) and now considering 225/243 (removed 18) transitions.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:12] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-08 09:47:12] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:12] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:12] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:12] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:12] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/248 places, 225/243 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-03b-06 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s21 1), p0:(NEQ s200 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13853 steps with 86 reset in 52 ms.
FORMULA AutoFlight-PT-03b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-06 finished in 482 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 247 transition count 158
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 95 rules applied. Total rules applied 179 place count 163 transition count 147
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 186 place count 157 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 156 transition count 146
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 187 place count 156 transition count 115
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 249 place count 125 transition count 115
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 255 place count 119 transition count 109
Iterating global reduction 4 with 6 rules applied. Total rules applied 261 place count 119 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 261 place count 119 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 267 place count 116 transition count 106
Performed 42 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 351 place count 74 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 352 place count 73 transition count 57
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 361 place count 67 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 364 place count 64 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 364 place count 64 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 370 place count 61 transition count 51
Applied a total of 370 rules in 18 ms. Remains 61 /248 variables (removed 187) and now considering 51/243 (removed 192) transitions.
// Phase 1: matrix 51 rows 61 cols
[2021-05-08 09:47:13] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants in 30 ms returned [47, 51, 55, 60]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
[2021-05-08 09:47:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 57 cols
[2021-05-08 09:47:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 57/248 places, 51/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 49
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 49
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 0 with 6 rules applied. Total rules applied 10 place count 52 transition count 46
Applied a total of 10 rules in 2 ms. Remains 52 /57 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 52 cols
[2021-05-08 09:47:13] [INFO ] Computed 12 place invariants in 11 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 46 rows 52 cols
[2021-05-08 09:47:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/248 places, 46/243 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(AND (EQ s24 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3462 steps with 233 reset in 5 ms.
FORMULA AutoFlight-PT-03b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-07 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 239 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 239 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 239 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 234 transition count 227
Applied a total of 30 rules in 14 ms. Remains 234 /248 variables (removed 14) and now considering 227/243 (removed 16) transitions.
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-08 09:47:13] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 234/248 places, 227/243 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-08 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:(AND (EQ s42 1) (EQ s151 1) (EQ s230 1)), p0:(EQ s131 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-03b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-08 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(p0)||(p1&&G(F(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 238 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 238 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 233 transition count 225
Applied a total of 33 rules in 13 ms. Remains 233 /248 variables (removed 15) and now considering 225/243 (removed 18) transitions.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:13] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:13] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/248 places, 225/243 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s29 0), p0:(AND (EQ s61 1) (EQ s166 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]]
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 233/233 places, 225/225 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 233 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 233 transition count 222
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 76 place count 233 transition count 237
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 109 place count 233 transition count 237
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 164 place count 178 transition count 182
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 219 place count 178 transition count 182
Performed 54 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 273 place count 178 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 178 transition count 176
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 306 place count 146 transition count 144
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 32 rules applied. Total rules applied 338 place count 146 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 339 place count 146 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 145 transition count 143
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 145 transition count 143
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 341 rules in 32 ms. Remains 145 /233 variables (removed 88) and now considering 143/225 (removed 82) transitions.
[2021-05-08 09:47:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 145 cols
[2021-05-08 09:47:15] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-08 09:47:15] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/233 places, 143/225 transitions.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
[2021-05-08 09:47:16] [INFO ] Flatten gal took : 11 ms
[2021-05-08 09:47:16] [INFO ] Flatten gal took : 10 ms
[2021-05-08 09:47:16] [INFO ] Time to serialize gal into /tmp/LTL17964834714071259367.gal : 6 ms
[2021-05-08 09:47:16] [INFO ] Time to serialize properties into /tmp/LTL3131928837038695367.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/LTL17964834714071259367.gal, -t, CGAL, -LTL, /tmp/LTL3131928837038695367.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/LTL17964834714071259367.gal -t CGAL -LTL /tmp/LTL3131928837038695367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((p90==1)&&(p227==1))"))||(("(p36==0)")&&(G(F("((p90!=1)||(p227!=1))"))))))))
Formula 0 simplified : !XF(X"((p90==1)&&(p227==1))" | ("(p36==0)" & GF"((p90!=1)||(p227!=1))"))
Detected timeout of ITS tools.
[2021-05-08 09:47:31] [INFO ] Flatten gal took : 11 ms
[2021-05-08 09:47:31] [INFO ] Applying decomposition
[2021-05-08 09:47:31] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15339237025137332335.txt, -o, /tmp/graph15339237025137332335.bin, -w, /tmp/graph15339237025137332335.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15339237025137332335.bin, -l, -1, -v, -w, /tmp/graph15339237025137332335.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 09:47:31] [INFO ] Decomposing Gal with order
[2021-05-08 09:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 09:47:31] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-08 09:47:31] [INFO ] Flatten gal took : 41 ms
[2021-05-08 09:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-08 09:47:31] [INFO ] Time to serialize gal into /tmp/LTL8263850215216528449.gal : 5 ms
[2021-05-08 09:47:31] [INFO ] Time to serialize properties into /tmp/LTL14825799362281502468.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/LTL8263850215216528449.gal, -t, CGAL, -LTL, /tmp/LTL14825799362281502468.ltl, -c, -stutter-deadlock], 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/LTL8263850215216528449.gal -t CGAL -LTL /tmp/LTL14825799362281502468.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((i8.u27.p90==1)&&(i8.u73.p227==1))"))||(("(i3.u11.p36==0)")&&(G(F("((i8.u27.p90!=1)||(i8.u73.p227!=1))"))))))))
Formula 0 simplified : !XF(X"((i8.u27.p90==1)&&(i8.u73.p227==1))" | ("(i3.u11.p36==0)" & GF"((i8.u27.p90!=1)||(i8.u73.p227!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t80, t90, t93, t106, t134, t157, t178, t234, t235, t237, i0.t77, i0.i2.t79, i1.t103, i1.i2.t105, i2.t125, i2.i1.u32.t11, i2.i1.u32.t128, i3.u13.t3, i3.u13.t181, i4.u9.t1, i4.u9.t188, i5.t174, i5.u14.t167, i6.u19.t5, i6.u19.t160, i7.t150, i7.i1.u21.t6, i7.i1.u21.t153, i8.t146, i8.u24.t142, i9.u28.t10, i9.u28.t137, i10.t121, i10.u36.t117, i12.t92, i13.u86.t41, i15.i0.t73, i17.i0.u82.t52, i18.i0.t29, i19.t236, i19.i1.t59, i19.i2.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/183/42/225
Computing Next relation with stutter on 120 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9925466357959880148
[2021-05-08 09:47:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9925466357959880148
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9925466357959880148]
Compilation finished in 983 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9925466357959880148]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((X((LTLAPp0==true))||((LTLAPp1==true)&&[](<>(!(LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9925466357959880148]
LTSmin run took 422 ms.
FORMULA AutoFlight-PT-03b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-09 finished in 34196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 239 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 239 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 239 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 236 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 234 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 234 transition count 227
Applied a total of 30 rules in 25 ms. Remains 234 /248 variables (removed 14) and now considering 227/243 (removed 16) transitions.
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:47] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:47] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:48] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 234 cols
[2021-05-08 09:47:48] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:48] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 234/248 places, 227/243 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (NEQ s164 1) (NEQ s232 1)), p0:(EQ s72 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 629 reset in 246 ms.
Product exploration explored 100000 steps with 626 reset in 179 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 627 reset in 153 ms.
Product exploration explored 100000 steps with 628 reset in 171 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 3 out of 234 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 234/234 places, 227/227 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 234 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 234 transition count 224
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 77 place count 234 transition count 233
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 107 place count 234 transition count 233
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 161 place count 180 transition count 179
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 215 place count 180 transition count 179
Performed 57 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 272 place count 180 transition count 173
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 309 place count 143 transition count 136
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 346 place count 143 transition count 136
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 346 rules in 24 ms. Remains 143 /234 variables (removed 91) and now considering 136/227 (removed 91) transitions.
[2021-05-08 09:47:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 136 rows 143 cols
[2021-05-08 09:47:49] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/234 places, 136/227 transitions.
Entered a terminal (fully accepting) state of product in 83223 steps with 4373 reset in 288 ms.
FORMULA AutoFlight-PT-03b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-10 finished in 1952 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 238 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 238 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 233 transition count 225
Applied a total of 33 rules in 19 ms. Remains 233 /248 variables (removed 15) and now considering 225/243 (removed 18) transitions.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:49] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-08 09:47:49] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:49] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-08 09:47:50] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 233 cols
[2021-05-08 09:47:50] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:50] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/248 places, 225/243 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s121 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 233/233 places, 225/225 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 233 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 233 transition count 222
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 76 place count 233 transition count 240
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 108 place count 233 transition count 240
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 162 place count 179 transition count 186
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 216 place count 179 transition count 186
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 271 place count 179 transition count 180
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 307 place count 143 transition count 144
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 343 place count 143 transition count 144
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 343 rules in 21 ms. Remains 143 /233 variables (removed 90) and now considering 144/225 (removed 81) transitions.
[2021-05-08 09:47:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 144 rows 143 cols
[2021-05-08 09:47:51] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:47:51] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/233 places, 144/225 transitions.
Product exploration explored 100000 steps with 50000 reset in 737 ms.
Product exploration explored 100000 steps with 50000 reset in 800 ms.
[2021-05-08 09:47:53] [INFO ] Flatten gal took : 9 ms
[2021-05-08 09:47:53] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:47:53] [INFO ] Time to serialize gal into /tmp/LTL12403303840436226149.gal : 1 ms
[2021-05-08 09:47:53] [INFO ] Time to serialize properties into /tmp/LTL7521868431544523274.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/LTL12403303840436226149.gal, -t, CGAL, -LTL, /tmp/LTL7521868431544523274.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/LTL12403303840436226149.gal -t CGAL -LTL /tmp/LTL7521868431544523274.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p181==0)"))))
Formula 0 simplified : !XF"(p181==0)"
Detected timeout of ITS tools.
[2021-05-08 09:48:08] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:48:08] [INFO ] Applying decomposition
[2021-05-08 09:48:08] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7499785778933798809.txt, -o, /tmp/graph7499785778933798809.bin, -w, /tmp/graph7499785778933798809.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7499785778933798809.bin, -l, -1, -v, -w, /tmp/graph7499785778933798809.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 09:48:08] [INFO ] Decomposing Gal with order
[2021-05-08 09:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 09:48:08] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-08 09:48:08] [INFO ] Flatten gal took : 17 ms
[2021-05-08 09:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 09:48:08] [INFO ] Time to serialize gal into /tmp/LTL14356960266016884112.gal : 3 ms
[2021-05-08 09:48:08] [INFO ] Time to serialize properties into /tmp/LTL13581649917111817929.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/LTL14356960266016884112.gal, -t, CGAL, -LTL, /tmp/LTL13581649917111817929.ltl, -c, -stutter-deadlock], 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/LTL14356960266016884112.gal -t CGAL -LTL /tmp/LTL13581649917111817929.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i13.i0.u50.p181==0)"))))
Formula 0 simplified : !XF"(i13.i0.u50.p181==0)"
Reverse transition relation is NOT exact ! Due to transitions t77, t80, t103, t106, t125, t134, t150, t157, t178, t234, t235, t237, i0.t93, i0.t90, i0.i2.t92, i1.i1.u9.t3, i1.i1.u9.t181, i2.u7.t1, i2.u7.t188, i3.t174, i3.u12.t167, i4.u16.t5, i4.u16.t160, i5.u19.t6, i5.u19.t153, i6.t146, i6.u24.t142, i7.u26.t10, i7.u26.t137, i8.u31.t11, i8.u31.t128, i9.i0.t121, i9.i0.u32.t117, i11.t105, i13.i0.t79, i15.i0.t73, i16.i1.u79.t52, i17.i1.t41, i18.i0.t29, i19.t236, i19.i0.t59, i19.i1.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/183/42/225
Computing Next relation with stutter on 120 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
101 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,1.04791,57680,1,0,109380,227,2408,118475,141,429,308114
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03b-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-03b-11 finished in 19606 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 239 transition count 234
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 239 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 235 transition count 227
Applied a total of 29 rules in 10 ms. Remains 235 /248 variables (removed 13) and now considering 227/243 (removed 16) transitions.
// Phase 1: matrix 227 rows 235 cols
[2021-05-08 09:48:09] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:48:09] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 227 rows 235 cols
[2021-05-08 09:48:09] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:48:09] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 235 cols
[2021-05-08 09:48:09] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:48:09] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/248 places, 227/243 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s39 1), p1:(NEQ s61 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 235/235 places, 227/227 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 235 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 235 transition count 224
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 77 place count 235 transition count 236
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 108 place count 235 transition count 236
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 162 place count 181 transition count 182
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 216 place count 181 transition count 182
Performed 56 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 272 place count 181 transition count 176
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 308 place count 145 transition count 140
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 344 place count 145 transition count 140
Deduced a syphon composed of 71 places in 1 ms
Applied a total of 344 rules in 30 ms. Remains 145 /235 variables (removed 90) and now considering 140/227 (removed 87) transitions.
[2021-05-08 09:48:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 140 rows 145 cols
[2021-05-08 09:48:11] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-08 09:48:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/235 places, 140/227 transitions.
Product exploration explored 100000 steps with 50000 reset in 764 ms.
Product exploration explored 100000 steps with 50000 reset in 772 ms.
[2021-05-08 09:48:12] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:48:12] [INFO ] Flatten gal took : 7 ms
[2021-05-08 09:48:12] [INFO ] Time to serialize gal into /tmp/LTL7302467842995809615.gal : 1 ms
[2021-05-08 09:48:12] [INFO ] Time to serialize properties into /tmp/LTL4293826182063508402.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/LTL7302467842995809615.gal, -t, CGAL, -LTL, /tmp/LTL4293826182063508402.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/LTL7302467842995809615.gal -t CGAL -LTL /tmp/LTL4293826182063508402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p52==1)"))||(X(F("(p88!=1)")))))
Formula 0 simplified : !(F"(p52==1)" | XF"(p88!=1)")
Detected timeout of ITS tools.
[2021-05-08 09:48:27] [INFO ] Flatten gal took : 7 ms
[2021-05-08 09:48:27] [INFO ] Applying decomposition
[2021-05-08 09:48:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6677995498969728758.txt, -o, /tmp/graph6677995498969728758.bin, -w, /tmp/graph6677995498969728758.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6677995498969728758.bin, -l, -1, -v, -w, /tmp/graph6677995498969728758.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 09:48:27] [INFO ] Decomposing Gal with order
[2021-05-08 09:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 09:48:27] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-08 09:48:27] [INFO ] Flatten gal took : 14 ms
[2021-05-08 09:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-08 09:48:27] [INFO ] Time to serialize gal into /tmp/LTL11212071292330972973.gal : 2 ms
[2021-05-08 09:48:27] [INFO ] Time to serialize properties into /tmp/LTL13295451935506353340.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/LTL11212071292330972973.gal, -t, CGAL, -LTL, /tmp/LTL13295451935506353340.ltl, -c, -stutter-deadlock], 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/LTL11212071292330972973.gal -t CGAL -LTL /tmp/LTL13295451935506353340.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i4.u17.p52==1)"))||(X(F("(i7.u27.p88!=1)")))))
Formula 0 simplified : !(F"(i4.u17.p52==1)" | XF"(i7.u27.p88!=1)")
Reverse transition relation is NOT exact ! Due to transitions t90, t93, t125, t134, t157, t178, t234, t235, t237, i0.t80, i0.t77, i0.i2.t79, i1.u33.t11, i1.u33.t128, i2.u13.t3, i2.u13.t181, i3.u8.t1, i3.u8.t188, i4.t174, i4.u14.t167, i5.u19.t5, i5.u19.t160, i6.t150, i6.i1.u21.t6, i6.i1.u21.t153, i7.t8, i7.t7, i7.u25.t146, i8.u30.t10, i8.u30.t137, i9.t121, i9.u37.t117, i10.t106, i10.t103, i10.i2.t105, i12.t92, i14.i0.t73, i16.i0.t52, i17.i1.t41, i18.t29, i19.t236, i19.i0.t59, i19.i1.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/184/43/227
Computing Next relation with stutter on 120 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
139 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,1.42476,74084,1,0,152893,187,2398,167643,115,333,416212
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03b-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-03b-12 finished in 19985 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F((G(p1)||G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 247 transition count 157
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 97 rules applied. Total rules applied 182 place count 162 transition count 145
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 188 place count 156 transition count 145
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 188 place count 156 transition count 115
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 248 place count 126 transition count 115
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 255 place count 119 transition count 108
Iterating global reduction 3 with 7 rules applied. Total rules applied 262 place count 119 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 262 place count 119 transition count 105
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 268 place count 116 transition count 105
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 356 place count 72 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 71 transition count 54
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 362 place count 67 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 66 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 363 place count 66 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 367 place count 64 transition count 51
Applied a total of 367 rules in 13 ms. Remains 64 /248 variables (removed 184) and now considering 51/243 (removed 192) transitions.
// Phase 1: matrix 51 rows 64 cols
[2021-05-08 09:48:29] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants in 44 ms returned [25, 36, 47, 51, 57, 63]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 45 ms to find 6 implicit places.
[2021-05-08 09:48:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 58 cols
[2021-05-08 09:48:29] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:48:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 58/248 places, 51/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 50 transition count 43
Applied a total of 16 rules in 2 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
// Phase 1: matrix 43 rows 50 cols
[2021-05-08 09:48:29] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 43 rows 50 cols
[2021-05-08 09:48:29] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/248 places, 43/243 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s22 1) (NEQ s44 1)), p1:(AND (EQ s24 1) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-14 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 248/248 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 247 transition count 158
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 96 rules applied. Total rules applied 180 place count 163 transition count 146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 157 transition count 146
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 186 place count 157 transition count 115
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 248 place count 126 transition count 115
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 255 place count 119 transition count 108
Iterating global reduction 3 with 7 rules applied. Total rules applied 262 place count 119 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 262 place count 119 transition count 105
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 268 place count 116 transition count 105
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 356 place count 72 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 71 transition count 54
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 366 place count 65 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 369 place count 62 transition count 51
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 369 place count 62 transition count 48
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 59 transition count 48
Applied a total of 375 rules in 10 ms. Remains 59 /248 variables (removed 189) and now considering 48/243 (removed 195) transitions.
// Phase 1: matrix 48 rows 59 cols
[2021-05-08 09:48:29] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants in 63 ms returned [21, 34, 45, 49, 53, 58]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
[2021-05-08 09:48:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 53 cols
[2021-05-08 09:48:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:48:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 53/248 places, 48/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 48 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 47 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 47 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 45 transition count 40
Applied a total of 16 rules in 3 ms. Remains 45 /53 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 45 cols
[2021-05-08 09:48:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 40 rows 45 cols
[2021-05-08 09:48:29] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:48:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/248 places, 40/243 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6762 reset in 106 ms.
Product exploration explored 100000 steps with 6758 reset in 116 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6734 reset in 104 ms.
Product exploration explored 100000 steps with 6727 reset in 116 ms.
[2021-05-08 09:48:30] [INFO ] Flatten gal took : 2 ms
[2021-05-08 09:48:30] [INFO ] Flatten gal took : 1 ms
[2021-05-08 09:48:30] [INFO ] Time to serialize gal into /tmp/LTL7247305474860853112.gal : 0 ms
[2021-05-08 09:48:30] [INFO ] Time to serialize properties into /tmp/LTL9554780936243398261.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/LTL7247305474860853112.gal, -t, CGAL, -LTL, /tmp/LTL9554780936243398261.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/LTL7247305474860853112.gal -t CGAL -LTL /tmp/LTL9554780936243398261.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p197!=1)"))))
Formula 0 simplified : !GF"(p197!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 96 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 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.032099,17320,1,0,27,4431,24,15,1065,3235,65
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03b-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-03b-15 finished in 774 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620467311607

--------------------
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-03b"
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-03b, 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-162037990000410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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