About the Execution of ITS-Tools for AutoFlight-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16248.380 | 3600000.00 | 11158772.00 | 95615.30 | ?FFFFF?FFT??TFFT | normal |
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-162037990100474.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990100474
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-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 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.4K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K 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.7K Mar 23 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:18 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 266K 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-12b-00
FORMULA_NAME AutoFlight-PT-12b-01
FORMULA_NAME AutoFlight-PT-12b-02
FORMULA_NAME AutoFlight-PT-12b-03
FORMULA_NAME AutoFlight-PT-12b-04
FORMULA_NAME AutoFlight-PT-12b-05
FORMULA_NAME AutoFlight-PT-12b-06
FORMULA_NAME AutoFlight-PT-12b-07
FORMULA_NAME AutoFlight-PT-12b-08
FORMULA_NAME AutoFlight-PT-12b-09
FORMULA_NAME AutoFlight-PT-12b-10
FORMULA_NAME AutoFlight-PT-12b-11
FORMULA_NAME AutoFlight-PT-12b-12
FORMULA_NAME AutoFlight-PT-12b-13
FORMULA_NAME AutoFlight-PT-12b-14
FORMULA_NAME AutoFlight-PT-12b-15
=== Now, execution of the tool begins
BK_START 1620472488224
Running Version 0
[2021-05-08 11:15:02] [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 11:15:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:15:02] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-08 11:15:02] [INFO ] Transformed 1126 places.
[2021-05-08 11:15:02] [INFO ] Transformed 1124 transitions.
[2021-05-08 11:15:02] [INFO ] Found NUPN structural information;
[2021-05-08 11:15:02] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 162 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 11:15:02] [INFO ] Initial state test concluded for 2 properties.
Support contains 33 out of 1126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 152 places :
Symmetric choice reduction at 0 with 152 rule applications. Total rules 152 place count 974 transition count 972
Iterating global reduction 0 with 152 rules applied. Total rules applied 304 place count 974 transition count 972
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 328 place count 974 transition count 948
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 394 place count 908 transition count 882
Iterating global reduction 1 with 66 rules applied. Total rules applied 460 place count 908 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 471 place count 897 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 482 place count 897 transition count 871
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 491 place count 888 transition count 862
Iterating global reduction 1 with 9 rules applied. Total rules applied 500 place count 888 transition count 862
Applied a total of 500 rules in 376 ms. Remains 888 /1126 variables (removed 238) and now considering 862/1124 (removed 262) transitions.
// Phase 1: matrix 862 rows 888 cols
[2021-05-08 11:15:02] [INFO ] Computed 76 place invariants in 30 ms
[2021-05-08 11:15:03] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 862 rows 888 cols
[2021-05-08 11:15:03] [INFO ] Computed 76 place invariants in 9 ms
[2021-05-08 11:15:03] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
// Phase 1: matrix 862 rows 888 cols
[2021-05-08 11:15:03] [INFO ] Computed 76 place invariants in 7 ms
[2021-05-08 11:15:04] [INFO ] Dead Transitions using invariants and state equation in 393 ms returned []
Finished structural reductions, in 1 iterations. Remains : 888/1126 places, 862/1124 transitions.
[2021-05-08 11:15:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 11:15:04] [INFO ] Flatten gal took : 91 ms
FORMULA AutoFlight-PT-12b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 11:15:04] [INFO ] Flatten gal took : 45 ms
[2021-05-08 11:15:04] [INFO ] Input system was already deterministic with 862 transitions.
Incomplete random walk after 100000 steps, including 181 resets, run finished after 427 ms. (steps per millisecond=234 ) properties (out of 28) seen :23
Running SMT prover for 5 properties.
// Phase 1: matrix 862 rows 888 cols
[2021-05-08 11:15:05] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:15:05] [INFO ] [Real]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:15:05] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:05] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-08 11:15:05] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 4 ms to minimize.
[2021-05-08 11:15:06] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
[2021-05-08 11:15:06] [INFO ] Deduced a trap composed of 109 places in 203 ms of which 1 ms to minimize.
[2021-05-08 11:15:06] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2021-05-08 11:15:06] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 2 ms to minimize.
[2021-05-08 11:15:06] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 0 ms to minimize.
[2021-05-08 11:15:07] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 1 ms to minimize.
[2021-05-08 11:15:07] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 1 ms to minimize.
[2021-05-08 11:15:07] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:15:07] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 0 ms to minimize.
[2021-05-08 11:15:07] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 1 ms to minimize.
[2021-05-08 11:15:08] [INFO ] Deduced a trap composed of 120 places in 156 ms of which 0 ms to minimize.
[2021-05-08 11:15:08] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 0 ms to minimize.
[2021-05-08 11:15:08] [INFO ] Deduced a trap composed of 116 places in 150 ms of which 1 ms to minimize.
[2021-05-08 11:15:08] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 1 ms to minimize.
[2021-05-08 11:15:08] [INFO ] Deduced a trap composed of 156 places in 138 ms of which 1 ms to minimize.
[2021-05-08 11:15:09] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 0 ms to minimize.
[2021-05-08 11:15:09] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:15:09] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 0 ms to minimize.
[2021-05-08 11:15:09] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 0 ms to minimize.
[2021-05-08 11:15:09] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4126 ms
[2021-05-08 11:15:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:15:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2021-05-08 11:15:20] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:20] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-08 11:15:20] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2021-05-08 11:15:20] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 16 ms to minimize.
[2021-05-08 11:15:21] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 0 ms to minimize.
[2021-05-08 11:15:21] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2021-05-08 11:15:21] [INFO ] Deduced a trap composed of 80 places in 179 ms of which 1 ms to minimize.
[2021-05-08 11:15:21] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 0 ms to minimize.
[2021-05-08 11:15:21] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 1 ms to minimize.
[2021-05-08 11:15:22] [INFO ] Deduced a trap composed of 115 places in 160 ms of which 0 ms to minimize.
[2021-05-08 11:15:22] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 1 ms to minimize.
[2021-05-08 11:15:22] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 0 ms to minimize.
[2021-05-08 11:15:22] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 0 ms to minimize.
[2021-05-08 11:15:22] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 1 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 0 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 1 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 0 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 156 places in 137 ms of which 1 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 0 ms to minimize.
[2021-05-08 11:15:23] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 0 ms to minimize.
[2021-05-08 11:15:24] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 1 ms to minimize.
[2021-05-08 11:15:24] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 0 ms to minimize.
[2021-05-08 11:15:24] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3914 ms
[2021-05-08 11:15:24] [INFO ] Computed and/alt/rep : 859/1191/859 causal constraints (skipped 2 transitions) in 45 ms.
[2021-05-08 11:15:29] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 1 ms to minimize.
[2021-05-08 11:15:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-08 11:15:30] [INFO ] [Real]Absence check using 75 positive place invariants in 28 ms returned sat
[2021-05-08 11:15:30] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:30] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-08 11:15:30] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:15:30] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 0 ms to minimize.
[2021-05-08 11:15:30] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:15:31] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2021-05-08 11:15:31] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 0 ms to minimize.
[2021-05-08 11:15:31] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 1 ms to minimize.
[2021-05-08 11:15:31] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 1 ms to minimize.
[2021-05-08 11:15:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1299 ms
[2021-05-08 11:15:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:15:31] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2021-05-08 11:15:31] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:32] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-08 11:15:32] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:15:32] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 0 ms to minimize.
[2021-05-08 11:15:32] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 1 ms to minimize.
[2021-05-08 11:15:32] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2021-05-08 11:15:33] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 0 ms to minimize.
[2021-05-08 11:15:33] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 1 ms to minimize.
[2021-05-08 11:15:33] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 0 ms to minimize.
[2021-05-08 11:15:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1339 ms
[2021-05-08 11:15:33] [INFO ] Computed and/alt/rep : 859/1191/859 causal constraints (skipped 2 transitions) in 54 ms.
[2021-05-08 11:15:41] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2021-05-08 11:15:42] [INFO ] Deduced a trap composed of 149 places in 135 ms of which 1 ms to minimize.
[2021-05-08 11:15:42] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 0 ms to minimize.
[2021-05-08 11:15:42] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 1 ms to minimize.
[2021-05-08 11:15:42] [INFO ] Deduced a trap composed of 167 places in 131 ms of which 0 ms to minimize.
[2021-05-08 11:15:42] [INFO ] Deduced a trap composed of 157 places in 123 ms of which 0 ms to minimize.
[2021-05-08 11:15:43] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 1 ms to minimize.
[2021-05-08 11:15:43] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 0 ms to minimize.
[2021-05-08 11:15:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1550 ms
[2021-05-08 11:15:43] [INFO ] Added : 857 causal constraints over 173 iterations in 9971 ms. Result :sat
[2021-05-08 11:15:43] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2021-05-08 11:15:43] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:43] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-08 11:15:43] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2021-05-08 11:15:44] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-08 11:15:44] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2021-05-08 11:15:44] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2021-05-08 11:15:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 564 ms
[2021-05-08 11:15:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:15:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:15:44] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:44] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-08 11:15:44] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2021-05-08 11:15:45] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2021-05-08 11:15:45] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2021-05-08 11:15:45] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2021-05-08 11:15:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 562 ms
[2021-05-08 11:15:45] [INFO ] Computed and/alt/rep : 859/1191/859 causal constraints (skipped 2 transitions) in 40 ms.
[2021-05-08 11:15:53] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 1 ms to minimize.
[2021-05-08 11:15:53] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 1 ms to minimize.
[2021-05-08 11:15:53] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 1 ms to minimize.
[2021-05-08 11:15:53] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 1 ms to minimize.
[2021-05-08 11:15:53] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 0 ms to minimize.
[2021-05-08 11:15:54] [INFO ] Deduced a trap composed of 153 places in 133 ms of which 0 ms to minimize.
[2021-05-08 11:15:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1186 ms
[2021-05-08 11:15:54] [INFO ] Added : 854 causal constraints over 172 iterations in 9271 ms. Result :sat
[2021-05-08 11:15:54] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2021-05-08 11:15:54] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:54] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 1 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 0 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 1 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 0 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 0 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 1 ms to minimize.
[2021-05-08 11:15:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1035 ms
[2021-05-08 11:15:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:15:56] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2021-05-08 11:15:56] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:15:56] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-08 11:15:56] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 0 ms to minimize.
[2021-05-08 11:15:56] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 1 ms to minimize.
[2021-05-08 11:15:56] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 2 ms to minimize.
[2021-05-08 11:15:56] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 0 ms to minimize.
[2021-05-08 11:15:57] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 0 ms to minimize.
[2021-05-08 11:15:57] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 1 ms to minimize.
[2021-05-08 11:15:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1032 ms
[2021-05-08 11:15:57] [INFO ] Computed and/alt/rep : 859/1191/859 causal constraints (skipped 2 transitions) in 42 ms.
[2021-05-08 11:16:05] [INFO ] Added : 858 causal constraints over 172 iterations in 8093 ms. Result :sat
[2021-05-08 11:16:05] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2021-05-08 11:16:05] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:16:05] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-08 11:16:05] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 0 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 1 ms to minimize.
[2021-05-08 11:16:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1076 ms
[2021-05-08 11:16:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:16:07] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2021-05-08 11:16:07] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:16:07] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-08 11:16:07] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2021-05-08 11:16:07] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2021-05-08 11:16:07] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2021-05-08 11:16:07] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2021-05-08 11:16:08] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 0 ms to minimize.
[2021-05-08 11:16:08] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 0 ms to minimize.
[2021-05-08 11:16:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1072 ms
[2021-05-08 11:16:08] [INFO ] Computed and/alt/rep : 859/1191/859 causal constraints (skipped 2 transitions) in 42 ms.
[2021-05-08 11:16:16] [INFO ] Added : 849 causal constraints over 171 iterations in 8019 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 878 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 878 transition count 852
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 872 transition count 846
Applied a total of 32 rules in 166 ms. Remains 872 /888 variables (removed 16) and now considering 846/862 (removed 16) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:16:16] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:16:16] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:16:16] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:16:17] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:16:17] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:16:17] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/888 places, 846/862 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s447 1), p1:(EQ s528 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 684 reset in 320 ms.
Product exploration explored 100000 steps with 695 reset in 277 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 683 reset in 219 ms.
Product exploration explored 100000 steps with 682 reset in 220 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 872 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 872/872 places, 846/846 transitions.
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 872 transition count 846
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 299 place count 872 transition count 834
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 299 place count 872 transition count 897
Deduced a syphon composed of 400 places in 2 ms
Iterating global reduction 2 with 113 rules applied. Total rules applied 412 place count 872 transition count 897
Discarding 221 places :
Symmetric choice reduction at 2 with 221 rule applications. Total rules 633 place count 651 transition count 676
Deduced a syphon composed of 179 places in 4 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 854 place count 651 transition count 676
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 388 places in 1 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1063 place count 651 transition count 652
Renaming transitions due to excessive name length > 1024 char.
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 1198 place count 516 transition count 517
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 1333 place count 516 transition count 517
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 1333 rules in 234 ms. Remains 516 /872 variables (removed 356) and now considering 517/846 (removed 329) transitions.
[2021-05-08 11:16:19] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 517 rows 516 cols
[2021-05-08 11:16:19] [INFO ] Computed 76 place invariants in 6 ms
[2021-05-08 11:16:19] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Finished structural reductions, in 1 iterations. Remains : 516/872 places, 517/846 transitions.
Product exploration explored 100000 steps with 3561 reset in 669 ms.
Product exploration explored 100000 steps with 3594 reset in 648 ms.
[2021-05-08 11:16:34] [INFO ] Flatten gal took : 36 ms
[2021-05-08 11:16:34] [INFO ] Flatten gal took : 34 ms
[2021-05-08 11:16:34] [INFO ] Time to serialize gal into /tmp/LTL11535479604802977920.gal : 30 ms
[2021-05-08 11:16:34] [INFO ] Time to serialize properties into /tmp/LTL10401723022948114438.ltl : 8 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/LTL11535479604802977920.gal, -t, CGAL, -LTL, /tmp/LTL10401723022948114438.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/LTL11535479604802977920.gal -t CGAL -LTL /tmp/LTL10401723022948114438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(p672==1)"))||(X(G("(p768==1)")))))))
Formula 0 simplified : !XX(F"(p672==1)" | XG"(p768==1)")
Detected timeout of ITS tools.
[2021-05-08 11:16:49] [INFO ] Flatten gal took : 39 ms
[2021-05-08 11:16:49] [INFO ] Applying decomposition
[2021-05-08 11:16:49] [INFO ] Flatten gal took : 33 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/graph5152202206827014214.txt, -o, /tmp/graph5152202206827014214.bin, -w, /tmp/graph5152202206827014214.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/graph5152202206827014214.bin, -l, -1, -v, -w, /tmp/graph5152202206827014214.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:16:53] [INFO ] Decomposing Gal with order
[2021-05-08 11:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:16:54] [INFO ] Removed a total of 167 redundant transitions.
[2021-05-08 11:16:54] [INFO ] Flatten gal took : 128 ms
[2021-05-08 11:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-08 11:16:54] [INFO ] Time to serialize gal into /tmp/LTL966847725126884871.gal : 15 ms
[2021-05-08 11:16:54] [INFO ] Time to serialize properties into /tmp/LTL15978269283257822330.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/LTL966847725126884871.gal, -t, CGAL, -LTL, /tmp/LTL15978269283257822330.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/LTL966847725126884871.gal -t CGAL -LTL /tmp/LTL15978269283257822330.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(i18.i1.i0.u187.p672==1)"))||(X(G("(i22.i0.i0.u220.p768==1)")))))))
Formula 0 simplified : !XX(F"(i18.i1.i0.u187.p672==1)" | XG"(i22.i0.i0.u220.p768==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11978112579848729797
[2021-05-08 11:17:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11978112579848729797
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/ltsmin11978112579848729797]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11978112579848729797] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin11978112579848729797] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-00 finished in 58097 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 887 transition count 550
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 348 rules applied. Total rules applied 659 place count 576 transition count 513
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 684 place count 552 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 551 transition count 512
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 685 place count 551 transition count 406
Deduced a syphon composed of 106 places in 2 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 897 place count 445 transition count 406
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 905 place count 437 transition count 398
Iterating global reduction 4 with 8 rules applied. Total rules applied 913 place count 437 transition count 398
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 913 place count 437 transition count 394
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 921 place count 433 transition count 394
Performed 168 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1257 place count 265 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1258 place count 264 transition count 202
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1290 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1300 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1300 place count 232 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1324 place count 220 transition count 180
Applied a total of 1324 rules in 94 ms. Remains 220 /888 variables (removed 668) and now considering 180/862 (removed 682) transitions.
// Phase 1: matrix 180 rows 220 cols
[2021-05-08 11:17:14] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-08 11:17:14] [INFO ] Implicit Places using invariants in 142 ms returned [130, 168, 172, 176, 180, 184, 188, 193, 197, 201, 205, 209, 213, 219]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 144 ms to find 14 implicit places.
[2021-05-08 11:17:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 180 rows 206 cols
[2021-05-08 11:17:14] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 11:17:14] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 206/888 places, 180/862 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 194 transition count 168
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 194 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 192 transition count 166
Applied a total of 28 rules in 24 ms. Remains 192 /206 variables (removed 14) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 192 cols
[2021-05-08 11:17:14] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:17:14] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 166 rows 192 cols
[2021-05-08 11:17:14] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:17:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 11:17:15] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 192/888 places, 166/862 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s128 1), p0:(NEQ s126 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 80238 steps with 2063 reset in 227 ms.
FORMULA AutoFlight-PT-12b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-01 finished in 892 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 887 transition count 550
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 348 rules applied. Total rules applied 659 place count 576 transition count 513
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 684 place count 552 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 551 transition count 512
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 685 place count 551 transition count 405
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 899 place count 444 transition count 405
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 907 place count 436 transition count 397
Iterating global reduction 4 with 8 rules applied. Total rules applied 915 place count 436 transition count 397
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 915 place count 436 transition count 393
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 923 place count 432 transition count 393
Performed 167 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1257 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1258 place count 264 transition count 202
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1290 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1300 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1300 place count 232 transition count 180
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1324 place count 220 transition count 180
Applied a total of 1324 rules in 89 ms. Remains 220 /888 variables (removed 668) and now considering 180/862 (removed 682) transitions.
// Phase 1: matrix 180 rows 220 cols
[2021-05-08 11:17:15] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-08 11:17:15] [INFO ] Implicit Places using invariants in 106 ms returned [88, 126, 164, 174, 178, 188, 193, 197, 201, 205, 209, 213, 219]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 107 ms to find 13 implicit places.
[2021-05-08 11:17:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 180 rows 207 cols
[2021-05-08 11:17:15] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 11:17:15] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 207/888 places, 180/862 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 196 transition count 169
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 196 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 195 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 195 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 194 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 194 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 193 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 193 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 192 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 192 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 191 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 191 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 190 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 190 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 189 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 189 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 188 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 188 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 187 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 187 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 186 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 186 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 185 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 185 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 184 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 184 transition count 157
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 52 place count 181 transition count 154
Applied a total of 52 rules in 87 ms. Remains 181 /207 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 181 cols
[2021-05-08 11:17:15] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-08 11:17:15] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 154 rows 181 cols
[2021-05-08 11:17:15] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 11:17:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 11:17:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 181/888 places, 154/862 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-03 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:(AND (NEQ s154 1) (NEQ s163 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 2984 reset in 324 ms.
Stack based approach found an accepted trace after 32976 steps with 982 reset with depth 15 and stack size 15 in 126 ms.
FORMULA AutoFlight-PT-12b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-03 finished in 1129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(X((p1&&X(X(X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 878 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 878 transition count 852
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 872 transition count 846
Applied a total of 32 rules in 136 ms. Remains 872 /888 variables (removed 16) and now considering 846/862 (removed 16) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:16] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:17:16] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:16] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:17:17] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:17] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:17:17] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/888 places, 846/862 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/aut17759909520055196840.hoa, --product-and=/tmp/stutter12336496872974206916.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 17707 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), false, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p1), acceptance={0} source=9 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=10 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 13}, { cond=p0, acceptance={0} source=10 dest: 14}], [{ cond=(NOT p0), acceptance={} source=11 dest: 5}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND p0 p1), acceptance={0} source=12 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={0} source=12 dest: 16}, { cond=p0, acceptance={0} source=12 dest: 19}, { cond=(NOT p0), acceptance={0} source=12 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=13 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 18}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 21}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 22}], [{ cond=(NOT p0), acceptance={} source=14 dest: 8}, { cond=p0, acceptance={} source=14 dest: 22}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=15 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=15 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={0} source=15 dest: 19}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=15 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=16 dest: 17}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 18}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=16 dest: 21}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 22}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=17 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=17 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=17 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={0} source=17 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=18 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=18 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=18 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=18 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=18 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=19 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=19 dest: 22}], [{ cond=(NOT p2), acceptance={} source=20 dest: 8}], [{ cond=(NOT p2), acceptance={} source=21 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=22 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=22 dest: 11}]], initial=0, aps=[p0:(OR (EQ s806 0) (EQ s870 0)), p1:(NEQ s358 0), p2:(OR (NEQ s806 1) (NEQ s870 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3690 steps with 6 reset in 10 ms.
FORMULA AutoFlight-PT-12b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-04 finished in 19031 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 887 transition count 548
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 663 place count 574 transition count 511
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 688 place count 550 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 549 transition count 510
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 689 place count 549 transition count 406
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 897 place count 445 transition count 406
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 904 place count 438 transition count 399
Iterating global reduction 4 with 7 rules applied. Total rules applied 911 place count 438 transition count 399
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 911 place count 438 transition count 396
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 917 place count 435 transition count 396
Performed 169 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1255 place count 266 transition count 204
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1256 place count 265 transition count 203
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 31 rules applied. Total rules applied 1287 place count 244 transition count 193
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1297 place count 234 transition count 193
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1297 place count 234 transition count 182
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1319 place count 223 transition count 182
Applied a total of 1319 rules in 66 ms. Remains 223 /888 variables (removed 665) and now considering 182/862 (removed 680) transitions.
// Phase 1: matrix 182 rows 223 cols
[2021-05-08 11:17:35] [INFO ] Computed 55 place invariants in 0 ms
[2021-05-08 11:17:35] [INFO ] Implicit Places using invariants in 121 ms returned [94, 132, 170, 174, 178, 182, 186, 190, 195, 199, 203, 207, 211, 215, 222]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 123 ms to find 15 implicit places.
[2021-05-08 11:17:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 182 rows 208 cols
[2021-05-08 11:17:35] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:17:35] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 208/888 places, 182/862 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 195 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 195 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 194 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 194 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 193 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 193 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 192 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 191 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 190 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 190 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 189 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 189 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 188 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 188 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 187 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 187 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 186 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 186 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 185 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 185 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 184 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 184 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 183 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 183 transition count 157
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 52 place count 182 transition count 156
Applied a total of 52 rules in 44 ms. Remains 182 /208 variables (removed 26) and now considering 156/182 (removed 26) transitions.
// Phase 1: matrix 156 rows 182 cols
[2021-05-08 11:17:35] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:17:35] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 156 rows 182 cols
[2021-05-08 11:17:35] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:17:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 11:17:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 182/888 places, 156/862 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s45 0), p2:(AND (NEQ s93 1) (NEQ s82 1)), p1:(NEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6195 steps with 267 reset in 21 ms.
FORMULA AutoFlight-PT-12b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-05 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U ((X(p0)&&G(p1))||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 878 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 878 transition count 852
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 872 transition count 846
Applied a total of 32 rules in 117 ms. Remains 872 /888 variables (removed 16) and now considering 846/862 (removed 16) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:36] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:17:36] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:36] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:17:37] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:17:37] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:17:37] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/888 places, 846/862 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12b-06 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=2, aps=[p1:(OR (NEQ s604 1) (NEQ s590 0)), p0:(NEQ s590 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 182 reset in 249 ms.
Product exploration explored 100000 steps with 182 reset in 269 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 182 reset in 248 ms.
Product exploration explored 100000 steps with 181 reset in 273 ms.
Applying partial POR strategy [false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 872 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 872/872 places, 846/846 transitions.
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 872 transition count 846
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 298 place count 872 transition count 834
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 298 place count 872 transition count 897
Deduced a syphon composed of 400 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 412 place count 872 transition count 897
Discarding 220 places :
Symmetric choice reduction at 2 with 220 rule applications. Total rules 632 place count 652 transition count 677
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 2 with 220 rules applied. Total rules applied 852 place count 652 transition count 677
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 389 places in 1 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1061 place count 652 transition count 653
Renaming transitions due to excessive name length > 1024 char.
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 1196 place count 517 transition count 518
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 1331 place count 517 transition count 518
Deduced a syphon composed of 254 places in 0 ms
Applied a total of 1331 rules in 125 ms. Remains 517 /872 variables (removed 355) and now considering 518/846 (removed 328) transitions.
[2021-05-08 11:17:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 518 rows 517 cols
[2021-05-08 11:17:39] [INFO ] Computed 76 place invariants in 7 ms
[2021-05-08 11:17:39] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/872 places, 518/846 transitions.
Product exploration explored 100000 steps with 259 reset in 318 ms.
Product exploration explored 100000 steps with 257 reset in 351 ms.
[2021-05-08 11:17:40] [INFO ] Flatten gal took : 25 ms
[2021-05-08 11:17:40] [INFO ] Flatten gal took : 25 ms
[2021-05-08 11:17:40] [INFO ] Time to serialize gal into /tmp/LTL13162470233480964109.gal : 3 ms
[2021-05-08 11:17:54] [INFO ] Time to serialize properties into /tmp/LTL9155951884231213738.ltl : 14602 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/LTL13162470233480964109.gal, -t, CGAL, -LTL, /tmp/LTL9155951884231213738.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/LTL13162470233480964109.gal -t CGAL -LTL /tmp/LTL9155951884231213738.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X("(p831!=1)"))U((X(G("(p831!=1)")))||((X("(p831!=1)"))&&(G("((p845!=1)||(p831!=0))")))))))
Formula 0 simplified : !X(X"(p831!=1)" U (XG"(p831!=1)" | (X"(p831!=1)" & G"((p845!=1)||(p831!=0))")))
Detected timeout of ITS tools.
[2021-05-08 11:18:09] [INFO ] Flatten gal took : 24 ms
[2021-05-08 11:18:09] [INFO ] Applying decomposition
[2021-05-08 11:18:10] [INFO ] Flatten gal took : 24 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/graph452233152603466750.txt, -o, /tmp/graph452233152603466750.bin, -w, /tmp/graph452233152603466750.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/graph452233152603466750.bin, -l, -1, -v, -w, /tmp/graph452233152603466750.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:18:12] [INFO ] Decomposing Gal with order
[2021-05-08 11:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:18:12] [INFO ] Removed a total of 165 redundant transitions.
[2021-05-08 11:18:12] [INFO ] Flatten gal took : 46 ms
[2021-05-08 11:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 11:18:12] [INFO ] Time to serialize gal into /tmp/LTL13534583296024442678.gal : 6 ms
[2021-05-08 11:18:12] [INFO ] Time to serialize properties into /tmp/LTL10964207294041652116.ltl : 8 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/LTL13534583296024442678.gal, -t, CGAL, -LTL, /tmp/LTL10964207294041652116.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/LTL13534583296024442678.gal -t CGAL -LTL /tmp/LTL10964207294041652116.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X("(i23.i1.i1.u247.p831!=1)"))U((X(G("(i23.i1.i1.u247.p831!=1)")))||((X("(i23.i1.i1.u247.p831!=1)"))&&(G("((i23.i2.i2.u254.p845!=1)||(i23.i1.i1.u247.p831!=0))")))))))
Formula 0 simplified : !X(X"(i23.i1.i1.u247.p831!=1)" U (XG"(i23.i1.i1.u247.p831!=1)" | (X"(i23.i1.i1.u247.p831!=1)" & G"((i23.i2.i2.u254.p845!=1)||(i23.i1.i1.u247.p831!=0))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12259190123988210796
[2021-05-08 11:18:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12259190123988210796
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/ltsmin12259190123988210796]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12259190123988210796] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12259190123988210796] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-06 finished in 57536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 887 transition count 546
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 352 rules applied. Total rules applied 667 place count 572 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 691 place count 548 transition count 509
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 691 place count 548 transition count 405
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 899 place count 444 transition count 405
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 906 place count 437 transition count 398
Iterating global reduction 3 with 7 rules applied. Total rules applied 913 place count 437 transition count 398
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 913 place count 437 transition count 394
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 921 place count 433 transition count 394
Performed 169 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 1259 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1260 place count 263 transition count 201
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1292 place count 241 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1302 place count 231 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1302 place count 231 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1326 place count 219 transition count 179
Applied a total of 1326 rules in 53 ms. Remains 219 /888 variables (removed 669) and now considering 179/862 (removed 683) transitions.
// Phase 1: matrix 179 rows 219 cols
[2021-05-08 11:18:33] [INFO ] Computed 54 place invariants in 0 ms
[2021-05-08 11:18:33] [INFO ] Implicit Places using invariants in 104 ms returned [91, 129, 167, 171, 175, 179, 183, 187, 192, 196, 200, 204, 208, 212, 218]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 105 ms to find 15 implicit places.
[2021-05-08 11:18:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 179 rows 204 cols
[2021-05-08 11:18:33] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-08 11:18:34] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Starting structural reductions, iteration 1 : 204/888 places, 179/862 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 191 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 179 transition count 154
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 52 place count 178 transition count 153
Applied a total of 52 rules in 40 ms. Remains 178 /204 variables (removed 26) and now considering 153/179 (removed 26) transitions.
// Phase 1: matrix 153 rows 178 cols
[2021-05-08 11:18:34] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-08 11:18:34] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 153 rows 178 cols
[2021-05-08 11:18:34] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-08 11:18:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-08 11:18:34] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 178/888 places, 153/862 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s90 1), p1:(NEQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6611 reset in 252 ms.
Product exploration explored 100000 steps with 6635 reset in 275 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6644 reset in 248 ms.
Product exploration explored 100000 steps with 6583 reset in 275 ms.
[2021-05-08 11:18:35] [INFO ] Flatten gal took : 6 ms
[2021-05-08 11:18:35] [INFO ] Flatten gal took : 6 ms
[2021-05-08 11:18:35] [INFO ] Time to serialize gal into /tmp/LTL16511356971135617556.gal : 1 ms
[2021-05-08 11:18:35] [INFO ] Time to serialize properties into /tmp/LTL16489705043983001313.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/LTL16511356971135617556.gal, -t, CGAL, -LTL, /tmp/LTL16489705043983001313.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/LTL16511356971135617556.gal -t CGAL -LTL /tmp/LTL16489705043983001313.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p729!=1)"))||(("(p729!=1)")&&(F("(p257!=0)"))))))
Formula 0 simplified : !F(G"(p729!=1)" | ("(p729!=1)" & F"(p257!=0)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t131, t179.t77, t133.t192, t169.t192, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/146/7/153
Computing Next relation with stutter on 385024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
113 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.14874,55276,1,0,400,217249,343,233,5027,175590,571
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-12b-07 finished in 3236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 879 transition count 853
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 879 transition count 853
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 873 transition count 847
Applied a total of 30 rules in 113 ms. Remains 873 /888 variables (removed 15) and now considering 847/862 (removed 15) transitions.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:37] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:18:37] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:37] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:18:37] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:37] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:18:38] [INFO ] Dead Transitions using invariants and state equation in 421 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/888 places, 847/862 transitions.
Stuttering acceptance computed with spot in 15499 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-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:(NEQ s204 1), p0:(NEQ s312 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 68830 steps with 125 reset in 156 ms.
FORMULA AutoFlight-PT-12b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-08 finished in 17028 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 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 879 transition count 853
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 879 transition count 853
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 873 transition count 847
Applied a total of 30 rules in 109 ms. Remains 873 /888 variables (removed 15) and now considering 847/862 (removed 15) transitions.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:54] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:18:54] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:54] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:18:54] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:18:54] [INFO ] Computed 76 place invariants in 8 ms
[2021-05-08 11:18:55] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/888 places, 847/862 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s814 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 718 ms.
Product exploration explored 100000 steps with 50000 reset in 737 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 709 ms.
Product exploration explored 100000 steps with 50000 reset in 733 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 873/873 places, 847/847 transitions.
Performed 277 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 301 place count 873 transition count 835
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 301 place count 873 transition count 898
Deduced a syphon composed of 402 places in 2 ms
Iterating global reduction 2 with 113 rules applied. Total rules applied 414 place count 873 transition count 898
Discarding 225 places :
Symmetric choice reduction at 2 with 225 rule applications. Total rules 639 place count 648 transition count 673
Deduced a syphon composed of 177 places in 2 ms
Iterating global reduction 2 with 225 rules applied. Total rules applied 864 place count 648 transition count 673
Performed 210 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 387 places in 0 ms
Iterating global reduction 2 with 210 rules applied. Total rules applied 1074 place count 648 transition count 649
Renaming transitions due to excessive name length > 1024 char.
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 1209 place count 513 transition count 514
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 1344 place count 513 transition count 514
Deduced a syphon composed of 252 places in 1 ms
Applied a total of 1344 rules in 124 ms. Remains 513 /873 variables (removed 360) and now considering 514/847 (removed 333) transitions.
[2021-05-08 11:18:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 514 rows 513 cols
[2021-05-08 11:18:58] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:18:58] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/873 places, 514/847 transitions.
Product exploration explored 100000 steps with 50000 reset in 2275 ms.
Product exploration explored 100000 steps with 50000 reset in 2290 ms.
[2021-05-08 11:19:03] [INFO ] Flatten gal took : 21 ms
[2021-05-08 11:19:03] [INFO ] Flatten gal took : 20 ms
[2021-05-08 11:19:13] [INFO ] Time to serialize gal into /tmp/LTL2224409525855039755.gal : 9690 ms
[2021-05-08 11:19:13] [INFO ] Time to serialize properties into /tmp/LTL4693289017013785178.ltl : 150 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/LTL2224409525855039755.gal, -t, CGAL, -LTL, /tmp/LTL4693289017013785178.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/LTL2224409525855039755.gal -t CGAL -LTL /tmp/LTL4693289017013785178.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p1064!=1)"))))
Formula 0 simplified : !XF"(p1064!=1)"
Detected timeout of ITS tools.
[2021-05-08 11:19:28] [INFO ] Flatten gal took : 21 ms
[2021-05-08 11:19:28] [INFO ] Applying decomposition
[2021-05-08 11:19:28] [INFO ] Flatten gal took : 20 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/graph8345908918752671682.txt, -o, /tmp/graph8345908918752671682.bin, -w, /tmp/graph8345908918752671682.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/graph8345908918752671682.bin, -l, -1, -v, -w, /tmp/graph8345908918752671682.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:19:32] [INFO ] Decomposing Gal with order
[2021-05-08 11:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:19:32] [INFO ] Removed a total of 167 redundant transitions.
[2021-05-08 11:19:32] [INFO ] Flatten gal took : 47 ms
[2021-05-08 11:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 11:19:32] [INFO ] Time to serialize gal into /tmp/LTL5237902717783629106.gal : 5 ms
[2021-05-08 11:19:32] [INFO ] Time to serialize properties into /tmp/LTL3975781728727849269.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/LTL5237902717783629106.gal, -t, CGAL, -LTL, /tmp/LTL3975781728727849269.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/LTL5237902717783629106.gal -t CGAL -LTL /tmp/LTL3975781728727849269.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i32.u347.p1064!=1)"))))
Formula 0 simplified : !XF"(i32.u347.p1064!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3964775262291683533
[2021-05-08 11:19:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3964775262291683533
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/ltsmin3964775262291683533]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3964775262291683533] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3964775262291683533] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-09 finished in 54545 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 878 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 878 transition count 852
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 872 transition count 846
Applied a total of 32 rules in 111 ms. Remains 872 /888 variables (removed 16) and now considering 846/862 (removed 16) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:19:51] [INFO ] Computed 76 place invariants in 11 ms
[2021-05-08 11:19:51] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:19:51] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:19:51] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:19:51] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:19:52] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/888 places, 846/862 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s670 1), p1:(NEQ s414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 182 reset in 264 ms.
Product exploration explored 100000 steps with 182 reset in 286 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 182 reset in 263 ms.
Product exploration explored 100000 steps with 181 reset in 279 ms.
[2021-05-08 11:19:53] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:19:53] [INFO ] Flatten gal took : 30 ms
[2021-05-08 11:19:53] [INFO ] Time to serialize gal into /tmp/LTL6132657056975969239.gal : 2 ms
[2021-05-08 11:19:53] [INFO ] Time to serialize properties into /tmp/LTL5762959812398835397.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/LTL6132657056975969239.gal, -t, CGAL, -LTL, /tmp/LTL5762959812398835397.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/LTL6132657056975969239.gal -t CGAL -LTL /tmp/LTL5762959812398835397.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p912==1)")||(X("(p630!=1)"))))))
Formula 0 simplified : !FG("(p912==1)" | X"(p630!=1)")
Detected timeout of ITS tools.
[2021-05-08 11:20:08] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:20:08] [INFO ] Applying decomposition
[2021-05-08 11:20:08] [INFO ] Flatten gal took : 18 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/graph10143931747748894394.txt, -o, /tmp/graph10143931747748894394.bin, -w, /tmp/graph10143931747748894394.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/graph10143931747748894394.bin, -l, -1, -v, -w, /tmp/graph10143931747748894394.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:20:10] [INFO ] Decomposing Gal with order
[2021-05-08 11:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:20:10] [INFO ] Removed a total of 163 redundant transitions.
[2021-05-08 11:20:10] [INFO ] Flatten gal took : 37 ms
[2021-05-08 11:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-08 11:20:11] [INFO ] Time to serialize gal into /tmp/LTL6074864591403433477.gal : 691 ms
[2021-05-08 11:20:11] [INFO ] Time to serialize properties into /tmp/LTL14023662063367544960.ltl : 93 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/LTL6074864591403433477.gal, -t, CGAL, -LTL, /tmp/LTL14023662063367544960.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/LTL6074864591403433477.gal -t CGAL -LTL /tmp/LTL14023662063367544960.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i22.u281.p912==1)")||(X("(i15.u169.p630!=1)"))))))
Formula 0 simplified : !FG("(i22.u281.p912==1)" | X"(i15.u169.p630!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5581448538457605967
[2021-05-08 11:20:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5581448538457605967
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/ltsmin5581448538457605967]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin5581448538457605967] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin5581448538457605967] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-10 finished in 38928 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 879 transition count 853
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 879 transition count 853
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 874 transition count 848
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 873 transition count 847
Applied a total of 30 rules in 125 ms. Remains 873 /888 variables (removed 15) and now considering 847/862 (removed 15) transitions.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:20:28] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:20:28] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:20:28] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:20:29] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 847 rows 873 cols
[2021-05-08 11:20:29] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:20:29] [INFO ] Dead Transitions using invariants and state equation in 394 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/888 places, 847/862 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s257 1) (EQ s403 1)), p0:(EQ s817 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 708 reset in 215 ms.
Product exploration explored 100000 steps with 717 reset in 228 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 710 reset in 218 ms.
Product exploration explored 100000 steps with 713 reset in 221 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 873 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 873/873 places, 847/847 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 23 rules applied. Total rules applied 299 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 299 place count 873 transition count 898
Deduced a syphon composed of 401 places in 1 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 413 place count 873 transition count 898
Discarding 222 places :
Symmetric choice reduction at 2 with 222 rule applications. Total rules 635 place count 651 transition count 676
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 857 place count 651 transition count 676
Performed 208 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 387 places in 0 ms
Iterating global reduction 2 with 208 rules applied. Total rules applied 1065 place count 651 transition count 652
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1199 place count 517 transition count 518
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1333 place count 517 transition count 518
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 1333 rules in 124 ms. Remains 517 /873 variables (removed 356) and now considering 518/847 (removed 329) transitions.
[2021-05-08 11:20:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 518 rows 517 cols
[2021-05-08 11:20:31] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:20:31] [INFO ] Dead Transitions using invariants and state equation in 488 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/873 places, 518/847 transitions.
Product exploration explored 100000 steps with 16717 reset in 1112 ms.
Product exploration explored 100000 steps with 16723 reset in 1140 ms.
[2021-05-08 11:20:33] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:20:33] [INFO ] Flatten gal took : 24 ms
[2021-05-08 11:20:33] [INFO ] Time to serialize gal into /tmp/LTL11720440684728586162.gal : 2 ms
[2021-05-08 11:20:33] [INFO ] Time to serialize properties into /tmp/LTL9536102849778704955.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/LTL11720440684728586162.gal, -t, CGAL, -LTL, /tmp/LTL9536102849778704955.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/LTL11720440684728586162.gal -t CGAL -LTL /tmp/LTL9536102849778704955.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p1067==1)")||(F("((p392==1)||(p615==1))")))))
Formula 0 simplified : !X("(p1067==1)" | F"((p392==1)||(p615==1))")
Detected timeout of ITS tools.
[2021-05-08 11:20:48] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:20:48] [INFO ] Applying decomposition
[2021-05-08 11:20:48] [INFO ] Flatten gal took : 18 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/graph5100817052034327563.txt, -o, /tmp/graph5100817052034327563.bin, -w, /tmp/graph5100817052034327563.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/graph5100817052034327563.bin, -l, -1, -v, -w, /tmp/graph5100817052034327563.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:20:49] [INFO ] Decomposing Gal with order
[2021-05-08 11:20:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:20:49] [INFO ] Removed a total of 170 redundant transitions.
[2021-05-08 11:20:49] [INFO ] Flatten gal took : 38 ms
[2021-05-08 11:20:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 11:20:49] [INFO ] Time to serialize gal into /tmp/LTL330792704088457267.gal : 9 ms
[2021-05-08 11:20:49] [INFO ] Time to serialize properties into /tmp/LTL10506413365836843673.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/LTL330792704088457267.gal, -t, CGAL, -LTL, /tmp/LTL10506413365836843673.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/LTL330792704088457267.gal -t CGAL -LTL /tmp/LTL10506413365836843673.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i28.u348.p1067==1)")||(F("((i12.u111.p392==1)||(i15.u171.p615==1))")))))
Formula 0 simplified : !X("(i28.u348.p1067==1)" | F"((i12.u111.p392==1)||(i15.u171.p615==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7394983499321269391
[2021-05-08 11:21:07] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7394983499321269391
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/ltsmin7394983499321269391]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin7394983499321269391] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin7394983499321269391] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-11 finished in 41264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 879 transition count 853
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 879 transition count 853
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 875 transition count 849
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 874 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 874 transition count 848
Applied a total of 28 rules in 118 ms. Remains 874 /888 variables (removed 14) and now considering 848/862 (removed 14) transitions.
// Phase 1: matrix 848 rows 874 cols
[2021-05-08 11:21:10] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:21:10] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 848 rows 874 cols
[2021-05-08 11:21:10] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:21:10] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
// Phase 1: matrix 848 rows 874 cols
[2021-05-08 11:21:10] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:21:11] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 874/888 places, 848/862 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-12b-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s708 1), p0:(EQ s293 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 734 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Product exploration explored 100000 steps with 50000 reset in 761 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 2 out of 874 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 874/874 places, 848/848 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 874 transition count 848
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 300 place count 874 transition count 836
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 300 place count 874 transition count 899
Deduced a syphon composed of 402 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 414 place count 874 transition count 899
Discarding 223 places :
Symmetric choice reduction at 2 with 223 rule applications. Total rules 637 place count 651 transition count 676
Deduced a syphon composed of 179 places in 2 ms
Iterating global reduction 2 with 223 rules applied. Total rules applied 860 place count 651 transition count 676
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 388 places in 0 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1069 place count 651 transition count 652
Renaming transitions due to excessive name length > 1024 char.
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 1204 place count 516 transition count 517
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 1339 place count 516 transition count 517
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 1339 rules in 122 ms. Remains 516 /874 variables (removed 358) and now considering 517/848 (removed 331) transitions.
[2021-05-08 11:21:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 517 rows 516 cols
[2021-05-08 11:21:14] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:21:15] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 516/874 places, 517/848 transitions.
Product exploration explored 100000 steps with 50000 reset in 2312 ms.
Product exploration explored 100000 steps with 50000 reset in 2303 ms.
[2021-05-08 11:21:19] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:21:19] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:21:19] [INFO ] Time to serialize gal into /tmp/LTL13068964410541493757.gal : 3 ms
[2021-05-08 11:21:29] [INFO ] Time to serialize properties into /tmp/LTL6892277514661856358.ltl : 9719 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/LTL13068964410541493757.gal, -t, CGAL, -LTL, /tmp/LTL6892277514661856358.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/LTL13068964410541493757.gal -t CGAL -LTL /tmp/LTL6892277514661856358.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p451==0)")&&(F("(p950!=1)")))))
Formula 0 simplified : !X("(p451==0)" & F"(p950!=1)")
Detected timeout of ITS tools.
[2021-05-08 11:21:44] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:21:44] [INFO ] Applying decomposition
[2021-05-08 11:21:44] [INFO ] Flatten gal took : 18 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/graph15615392944439639109.txt, -o, /tmp/graph15615392944439639109.bin, -w, /tmp/graph15615392944439639109.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/graph15615392944439639109.bin, -l, -1, -v, -w, /tmp/graph15615392944439639109.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:21:44] [INFO ] Decomposing Gal with order
[2021-05-08 11:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:21:44] [INFO ] Removed a total of 168 redundant transitions.
[2021-05-08 11:21:44] [INFO ] Flatten gal took : 45 ms
[2021-05-08 11:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-08 11:21:44] [INFO ] Time to serialize gal into /tmp/LTL1650858836536521203.gal : 5 ms
[2021-05-08 11:21:44] [INFO ] Time to serialize properties into /tmp/LTL11904608119523353293.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/LTL1650858836536521203.gal, -t, CGAL, -LTL, /tmp/LTL11904608119523353293.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/LTL1650858836536521203.gal -t CGAL -LTL /tmp/LTL11904608119523353293.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i14.u127.p451==0)")&&(F("(i27.u303.p950!=1)")))))
Formula 0 simplified : !X("(i14.u127.p451==0)" & F"(i27.u303.p950!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16404872749907205836
[2021-05-08 11:21:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16404872749907205836
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/ltsmin16404872749907205836]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin16404872749907205836] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin16404872749907205836] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-12 finished in 51988 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 879 transition count 853
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 879 transition count 853
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 875 transition count 849
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 875 transition count 849
Applied a total of 26 rules in 80 ms. Remains 875 /888 variables (removed 13) and now considering 849/862 (removed 13) transitions.
// Phase 1: matrix 849 rows 875 cols
[2021-05-08 11:22:00] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:01] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 849 rows 875 cols
[2021-05-08 11:22:01] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:01] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
// Phase 1: matrix 849 rows 875 cols
[2021-05-08 11:22:01] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:02] [INFO ] Dead Transitions using invariants and state equation in 389 ms returned []
Finished structural reductions, in 1 iterations. Remains : 875/888 places, 849/862 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s301 1), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], 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-12b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-14 finished in 1380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 888 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 888/888 places, 862/862 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 878 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 878 transition count 852
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 873 transition count 847
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 872 transition count 846
Applied a total of 32 rules in 106 ms. Remains 872 /888 variables (removed 16) and now considering 846/862 (removed 16) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:22:02] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:02] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:22:02] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:02] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:22:02] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 11:22:03] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/888 places, 846/862 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s705 0), p1:(EQ s614 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 724 ms.
Product exploration explored 100000 steps with 50000 reset in 757 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 724 ms.
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 872 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 872/872 places, 846/846 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 872 transition count 846
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 300 place count 872 transition count 834
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 300 place count 872 transition count 896
Deduced a syphon composed of 401 places in 2 ms
Iterating global reduction 2 with 113 rules applied. Total rules applied 413 place count 872 transition count 896
Discarding 223 places :
Symmetric choice reduction at 2 with 223 rule applications. Total rules 636 place count 649 transition count 673
Deduced a syphon composed of 178 places in 2 ms
Iterating global reduction 2 with 223 rules applied. Total rules applied 859 place count 649 transition count 673
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 387 places in 0 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1068 place count 649 transition count 649
Renaming transitions due to excessive name length > 1024 char.
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 1203 place count 514 transition count 514
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 1338 place count 514 transition count 514
Deduced a syphon composed of 252 places in 0 ms
Applied a total of 1338 rules in 117 ms. Remains 514 /872 variables (removed 358) and now considering 514/846 (removed 332) transitions.
[2021-05-08 11:22:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 514 rows 514 cols
[2021-05-08 11:22:06] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:22:07] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 514/872 places, 514/846 transitions.
Product exploration explored 100000 steps with 50000 reset in 2288 ms.
Product exploration explored 100000 steps with 50000 reset in 2305 ms.
[2021-05-08 11:22:11] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:22:11] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:22:11] [INFO ] Time to serialize gal into /tmp/LTL699498281617240566.gal : 2 ms
[2021-05-08 11:22:11] [INFO ] Time to serialize properties into /tmp/LTL16223858118597999774.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/LTL699498281617240566.gal, -t, CGAL, -LTL, /tmp/LTL16223858118597999774.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/LTL699498281617240566.gal -t CGAL -LTL /tmp/LTL16223858118597999774.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p949==0)")||(G(F("(p855==1)"))))))
Formula 0 simplified : !X("(p949==0)" | GF"(p855==1)")
Detected timeout of ITS tools.
[2021-05-08 11:22:26] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:22:26] [INFO ] Applying decomposition
[2021-05-08 11:22:26] [INFO ] Flatten gal took : 17 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/graph16171560464791868314.txt, -o, /tmp/graph16171560464791868314.bin, -w, /tmp/graph16171560464791868314.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/graph16171560464791868314.bin, -l, -1, -v, -w, /tmp/graph16171560464791868314.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:22:26] [INFO ] Decomposing Gal with order
[2021-05-08 11:22:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:22:27] [INFO ] Removed a total of 166 redundant transitions.
[2021-05-08 11:22:27] [INFO ] Flatten gal took : 32 ms
[2021-05-08 11:22:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 11:22:27] [INFO ] Time to serialize gal into /tmp/LTL4063304260059078549.gal : 357 ms
[2021-05-08 11:22:27] [INFO ] Time to serialize properties into /tmp/LTL133083495169566983.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/LTL4063304260059078549.gal, -t, CGAL, -LTL, /tmp/LTL133083495169566983.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/LTL4063304260059078549.gal -t CGAL -LTL /tmp/LTL133083495169566983.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i24.u295.p949==0)")||(G(F("(i23.u255.p855==1)"))))))
Formula 0 simplified : !X("(i24.u295.p949==0)" | GF"(i23.u255.p855==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13934989026259446615
[2021-05-08 11:22:42] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13934989026259446615
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/ltsmin13934989026259446615]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin13934989026259446615] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin13934989026259446615] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-12b-15 finished in 41469 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14703527845459875061
[2021-05-08 11:22:46] [INFO ] Computing symmetric may disable matrix : 862 transitions.
[2021-05-08 11:22:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:22:46] [INFO ] Computing symmetric may enable matrix : 862 transitions.
[2021-05-08 11:22:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:22:46] [INFO ] Applying decomposition
[2021-05-08 11:22:46] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:22:46] [INFO ] Computing Do-Not-Accords matrix : 862 transitions.
[2021-05-08 11:22:46] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:22:46] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14703527845459875061
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/ltsmin14703527845459875061]
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/graph11877735309965647084.txt, -o, /tmp/graph11877735309965647084.bin, -w, /tmp/graph11877735309965647084.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/graph11877735309965647084.bin, -l, -1, -v, -w, /tmp/graph11877735309965647084.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:22:47] [INFO ] Decomposing Gal with order
[2021-05-08 11:22:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:22:47] [INFO ] Removed a total of 164 redundant transitions.
[2021-05-08 11:22:47] [INFO ] Flatten gal took : 37 ms
[2021-05-08 11:22:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 11:22:47] [INFO ] Time to serialize gal into /tmp/LTLFireability10440047042745787017.gal : 5 ms
[2021-05-08 11:22:47] [INFO ] Time to serialize properties into /tmp/LTLFireability4844108454768884340.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/LTLFireability10440047042745787017.gal, -t, CGAL, -LTL, /tmp/LTLFireability4844108454768884340.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/LTLFireability10440047042745787017.gal -t CGAL -LTL /tmp/LTLFireability4844108454768884340.ltl -c -stutter-deadlock
Read 7 LTL properties
Checking formula 0 : !((X(X((F("(i18.u191.p672==1)"))||(X(G("(i19.i0.i1.u226.p768==1)")))))))
Formula 0 simplified : !XX(F"(i18.u191.p672==1)" | XG"(i19.i0.i1.u226.p768==1)")
Compilation finished in 6675 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14703527845459875061]
Link finished in 72 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))||X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
WARNING : LTSmin timed out (>257 s) on command 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))||X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
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((LTLAPp2==true)) U ((X((LTLAPp2==true))&&[]((LTLAPp3==true)))||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
WARNING : LTSmin timed out (>257 s) on command 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((LTLAPp2==true)) U ((X((LTLAPp2==true))&&[]((LTLAPp3==true)))||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
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(<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
LTSmin run took 600 ms.
FORMULA AutoFlight-PT-12b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, <>([](((LTLAPp5==true)||X((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
WARNING : LTSmin timed out (>257 s) on command 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, <>([](((LTLAPp5==true)||X((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
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(((LTLAPp7==true)||<>((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
WARNING : LTSmin timed out (>257 s) on command 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(((LTLAPp7==true)||<>((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
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(((LTLAPp9==true)&&<>((LTLAPp10==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
LTSmin run took 460 ms.
FORMULA AutoFlight-PT-12b-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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(((LTLAPp11==true)||[](<>((LTLAPp12==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
LTSmin run took 269 ms.
FORMULA AutoFlight-PT-12b-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2056 s
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))||X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
Detected timeout of ITS tools.
[2021-05-08 11:45:23] [INFO ] Applying decomposition
[2021-05-08 11:45:23] [INFO ] Flatten gal took : 163 ms
[2021-05-08 11:45:23] [INFO ] Decomposing Gal with order
[2021-05-08 11:45:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:45:24] [INFO ] Removed a total of 26 redundant transitions.
[2021-05-08 11:45:24] [INFO ] Flatten gal took : 197 ms
[2021-05-08 11:45:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 1910 ms.
[2021-05-08 11:45:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8121638305715972170.gal : 51 ms
[2021-05-08 11:45:27] [INFO ] Time to serialize properties into /tmp/LTLFireability14579525665698858441.ltl : 9 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/LTLFireability8121638305715972170.gal, -t, CGAL, -LTL, /tmp/LTLFireability14579525665698858441.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/LTLFireability8121638305715972170.gal -t CGAL -LTL /tmp/LTLFireability14579525665698858441.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X((F("(i0.i0.i0.i0.i0.i0.i0.i0.u112.p672==1)"))||(X(G("(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u134.p768==1)")))))))
Formula 0 simplified : !XX(F"(i0.i0.i0.i0.i0.i0.i0.i0.u112.p672==1)" | XG"(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u134.p768==1)")
Detected timeout of ITS tools.
[2021-05-08 12:08:08] [INFO ] Flatten gal took : 215 ms
[2021-05-08 12:08:09] [INFO ] Input system was already deterministic with 862 transitions.
[2021-05-08 12:08:09] [INFO ] Transformed 888 places.
[2021-05-08 12:08:09] [INFO ] Transformed 862 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 12:08:09] [INFO ] Time to serialize gal into /tmp/LTLFireability17749777527761988414.gal : 12 ms
[2021-05-08 12:08:09] [INFO ] Time to serialize properties into /tmp/LTLFireability14755734324724681121.ltl : 6 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/LTLFireability17749777527761988414.gal, -t, CGAL, -LTL, /tmp/LTLFireability14755734324724681121.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability17749777527761988414.gal -t CGAL -LTL /tmp/LTLFireability14755734324724681121.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((F("(p672==1)"))||(X(G("(p768==1)")))))))
Formula 0 simplified : !XX(F"(p672==1)" | XG"(p768==1)")
WARNING : LTSmin timed out (>2056 s) on command 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))||X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
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((LTLAPp2==true)) U ((X((LTLAPp2==true))&&[]((LTLAPp3==true)))||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14703527845459875061]
BK_TIME_CONFINEMENT_REACHED
--------------------
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-12b"
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-12b, 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-162037990100474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 '
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 ;