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-162037990100473.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990100473
=====================================================================

--------------------
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 1620472364065

Running Version 0
[2021-05-08 11:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:12:56] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2021-05-08 11:12:56] [INFO ] Transformed 1126 places.
[2021-05-08 11:12:56] [INFO ] Transformed 1124 transitions.
[2021-05-08 11:12:56] [INFO ] Found NUPN structural information;
[2021-05-08 11:12:56] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 11:12:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA AutoFlight-PT-12b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 327 place count 974 transition count 949
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 394 place count 907 transition count 882
Iterating global reduction 1 with 67 rules applied. Total rules applied 461 place count 907 transition count 882
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 473 place count 895 transition count 870
Iterating global reduction 1 with 12 rules applied. Total rules applied 485 place count 895 transition count 870
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 496 place count 884 transition count 859
Iterating global reduction 1 with 11 rules applied. Total rules applied 507 place count 884 transition count 859
Applied a total of 507 rules in 428 ms. Remains 884 /1126 variables (removed 242) and now considering 859/1124 (removed 265) transitions.
// Phase 1: matrix 859 rows 884 cols
[2021-05-08 11:12:56] [INFO ] Computed 76 place invariants in 35 ms
[2021-05-08 11:12:57] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 859 rows 884 cols
[2021-05-08 11:12:57] [INFO ] Computed 76 place invariants in 9 ms
[2021-05-08 11:12:57] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
// Phase 1: matrix 859 rows 884 cols
[2021-05-08 11:12:57] [INFO ] Computed 76 place invariants in 12 ms
[2021-05-08 11:12:58] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Finished structural reductions, in 1 iterations. Remains : 884/1126 places, 859/1124 transitions.
[2021-05-08 11:12:58] [INFO ] Flatten gal took : 91 ms
[2021-05-08 11:12:58] [INFO ] Flatten gal took : 51 ms
[2021-05-08 11:12:58] [INFO ] Input system was already deterministic with 859 transitions.
Incomplete random walk after 100000 steps, including 183 resets, run finished after 551 ms. (steps per millisecond=181 ) properties (out of 17) seen :11
Running SMT prover for 6 properties.
// Phase 1: matrix 859 rows 884 cols
[2021-05-08 11:12:59] [INFO ] Computed 76 place invariants in 6 ms
[2021-05-08 11:12:59] [INFO ] [Real]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:12:59] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:12:59] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-08 11:12:59] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 4 ms to minimize.
[2021-05-08 11:12:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2021-05-08 11:12:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 29 ms returned sat
[2021-05-08 11:13:00] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:00] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-08 11:13:00] [INFO ] Deduced a trap composed of 83 places in 176 ms of which 4 ms to minimize.
[2021-05-08 11:13:00] [INFO ] Deduced a trap composed of 146 places in 158 ms of which 1 ms to minimize.
[2021-05-08 11:13:00] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 2 ms to minimize.
[2021-05-08 11:13:01] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 1 ms to minimize.
[2021-05-08 11:13:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 817 ms
[2021-05-08 11:13:01] [INFO ] Computed and/alt/rep : 856/1189/856 causal constraints (skipped 2 transitions) in 46 ms.
[2021-05-08 11:13:09] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 0 ms to minimize.
[2021-05-08 11:13:09] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 0 ms to minimize.
[2021-05-08 11:13:09] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 1 ms to minimize.
[2021-05-08 11:13:09] [INFO ] Deduced a trap composed of 161 places in 119 ms of which 0 ms to minimize.
[2021-05-08 11:13:10] [INFO ] Deduced a trap composed of 149 places in 120 ms of which 0 ms to minimize.
[2021-05-08 11:13:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1003 ms
[2021-05-08 11:13:10] [INFO ] Added : 849 causal constraints over 170 iterations in 9190 ms. Result :sat
[2021-05-08 11:13:10] [INFO ] [Real]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:13:10] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:10] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-08 11:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned unsat
[2021-05-08 11:13:10] [INFO ] [Real]Absence check using 75 positive place invariants in 29 ms returned sat
[2021-05-08 11:13:10] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:11] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-08 11:13:11] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 0 ms to minimize.
[2021-05-08 11:13:11] [INFO ] Deduced a trap composed of 202 places in 160 ms of which 1 ms to minimize.
[2021-05-08 11:13:11] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 0 ms to minimize.
[2021-05-08 11:13:12] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 1 ms to minimize.
[2021-05-08 11:13:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2021-05-08 11:13:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:13:12] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:12] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-08 11:13:12] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 0 ms to minimize.
[2021-05-08 11:13:12] [INFO ] Deduced a trap composed of 202 places in 142 ms of which 1 ms to minimize.
[2021-05-08 11:13:12] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 0 ms to minimize.
[2021-05-08 11:13:13] [INFO ] Deduced a trap composed of 149 places in 137 ms of which 0 ms to minimize.
[2021-05-08 11:13:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 701 ms
[2021-05-08 11:13:13] [INFO ] Computed and/alt/rep : 856/1189/856 causal constraints (skipped 2 transitions) in 37 ms.
[2021-05-08 11:13:21] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 0 ms to minimize.
[2021-05-08 11:13:21] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2021-05-08 11:13:21] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 1 ms to minimize.
[2021-05-08 11:13:22] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 1 ms to minimize.
[2021-05-08 11:13:22] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 0 ms to minimize.
[2021-05-08 11:13:22] [INFO ] Deduced a trap composed of 180 places in 119 ms of which 0 ms to minimize.
[2021-05-08 11:13:22] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 1 ms to minimize.
[2021-05-08 11:13:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1301 ms
[2021-05-08 11:13:22] [INFO ] Added : 853 causal constraints over 171 iterations in 9496 ms. Result :sat
[2021-05-08 11:13:22] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2021-05-08 11:13:22] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:23] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-08 11:13:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:23] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2021-05-08 11:13:23] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:23] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-08 11:13:23] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2021-05-08 11:13:23] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 0 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 151 places in 154 ms of which 1 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 1 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2021-05-08 11:13:24] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 1 ms to minimize.
[2021-05-08 11:13:25] [INFO ] Deduced a trap composed of 200 places in 144 ms of which 0 ms to minimize.
[2021-05-08 11:13:25] [INFO ] Deduced a trap composed of 149 places in 149 ms of which 0 ms to minimize.
[2021-05-08 11:13:25] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 1 ms to minimize.
[2021-05-08 11:13:25] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2021-05-08 11:13:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2111 ms
[2021-05-08 11:13:25] [INFO ] Computed and/alt/rep : 856/1189/856 causal constraints (skipped 2 transitions) in 41 ms.
[2021-05-08 11:13:33] [INFO ] Added : 798 causal constraints over 160 iterations in 7573 ms. Result :sat
[2021-05-08 11:13:33] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2021-05-08 11:13:33] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:33] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-08 11:13:33] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2021-05-08 11:13:33] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 0 ms to minimize.
[2021-05-08 11:13:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2021-05-08 11:13:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:34] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2021-05-08 11:13:34] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:34] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-08 11:13:34] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2021-05-08 11:13:34] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 0 ms to minimize.
[2021-05-08 11:13:34] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 0 ms to minimize.
[2021-05-08 11:13:34] [INFO ] Deduced a trap composed of 149 places in 132 ms of which 1 ms to minimize.
[2021-05-08 11:13:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 720 ms
[2021-05-08 11:13:35] [INFO ] Computed and/alt/rep : 856/1189/856 causal constraints (skipped 2 transitions) in 40 ms.
[2021-05-08 11:13:42] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 1 ms to minimize.
[2021-05-08 11:13:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2021-05-08 11:13:43] [INFO ] Added : 840 causal constraints over 168 iterations in 8049 ms. Result :sat
[2021-05-08 11:13:43] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2021-05-08 11:13:43] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:43] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-08 11:13:43] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2021-05-08 11:13:43] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2021-05-08 11:13:43] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2021-05-08 11:13:44] [INFO ] Deduced a trap composed of 152 places in 159 ms of which 0 ms to minimize.
[2021-05-08 11:13:44] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 0 ms to minimize.
[2021-05-08 11:13:44] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 1 ms to minimize.
[2021-05-08 11:13:44] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 0 ms to minimize.
[2021-05-08 11:13:44] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 1 ms to minimize.
[2021-05-08 11:13:45] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2021-05-08 11:13:45] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 0 ms to minimize.
[2021-05-08 11:13:45] [INFO ] Deduced a trap composed of 174 places in 138 ms of which 0 ms to minimize.
[2021-05-08 11:13:45] [INFO ] Deduced a trap composed of 174 places in 143 ms of which 0 ms to minimize.
[2021-05-08 11:13:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2157 ms
[2021-05-08 11:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:13:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 27 ms returned sat
[2021-05-08 11:13:45] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:13:45] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-08 11:13:46] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2021-05-08 11:13:46] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2021-05-08 11:13:46] [INFO ] Deduced a trap composed of 149 places in 153 ms of which 0 ms to minimize.
[2021-05-08 11:13:46] [INFO ] Deduced a trap composed of 152 places in 154 ms of which 1 ms to minimize.
[2021-05-08 11:13:46] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 0 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 1 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 1 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 0 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 0 ms to minimize.
[2021-05-08 11:13:47] [INFO ] Deduced a trap composed of 174 places in 136 ms of which 1 ms to minimize.
[2021-05-08 11:13:48] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 0 ms to minimize.
[2021-05-08 11:13:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2115 ms
[2021-05-08 11:13:48] [INFO ] Computed and/alt/rep : 856/1189/856 causal constraints (skipped 2 transitions) in 40 ms.
[2021-05-08 11:13:59] [INFO ] Deduced a trap composed of 156 places in 87 ms of which 2 ms to minimize.
[2021-05-08 11:13:59] [INFO ] Deduced a trap composed of 152 places in 77 ms of which 1 ms to minimize.
[2021-05-08 11:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2021-05-08 11:13:59] [INFO ] Added : 811 causal constraints over 163 iterations in 11444 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-08 11:13:59] [INFO ] Initial state test concluded for 1 properties.
FORMULA AutoFlight-PT-12b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||((!p0&&F(p1)) U (G((!p0&&F(p1)))||(F(G(p1))&&p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 884/884 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 883 transition count 552
Reduce places removed 306 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 343 rules applied. Total rules applied 649 place count 577 transition count 515
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 675 place count 553 transition count 513
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 677 place count 551 transition count 513
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 677 place count 551 transition count 407
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 889 place count 445 transition count 407
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 892 place count 442 transition count 404
Iterating global reduction 4 with 3 rules applied. Total rules applied 895 place count 442 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 895 place count 442 transition count 402
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 899 place count 440 transition count 402
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1241 place count 269 transition count 207
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 1242 place count 268 transition count 206
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 28 rules applied. Total rules applied 1270 place count 248 transition count 198
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1278 place count 240 transition count 198
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1278 place count 240 transition count 186
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 1302 place count 228 transition count 186
Applied a total of 1302 rules in 185 ms. Remains 228 /884 variables (removed 656) and now considering 186/859 (removed 673) transitions.
// Phase 1: matrix 186 rows 228 cols
[2021-05-08 11:13:59] [INFO ] Computed 56 place invariants in 2 ms
[2021-05-08 11:13:59] [INFO ] Implicit Places using invariants in 222 ms returned [96, 134, 172, 176, 188, 193, 197, 202, 206, 210, 214, 218, 222, 227]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 224 ms to find 14 implicit places.
[2021-05-08 11:14:00] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 186 rows 214 cols
[2021-05-08 11:14:00] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-08 11:14:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 214/884 places, 186/859 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 202 transition count 174
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 202 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 201 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 201 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 200 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 200 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 199 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 199 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 198 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 198 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 197 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 197 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 195 transition count 167
Applied a total of 38 rules in 26 ms. Remains 195 /214 variables (removed 19) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 195 cols
[2021-05-08 11:14:00] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-08 11:14:00] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 167 rows 195 cols
[2021-05-08 11:14:00] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-08 11:14:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 11:14:00] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 195/884 places, 167/859 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-01 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s95 1), p2:(AND (NEQ s173 0) (NEQ s58 1) (NEQ s95 1)), p1:(NEQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-12b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-01 finished in 1292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 884/884 places, 859/859 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 851
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 851
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 876 transition count 850
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 872 transition count 846
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 872 transition count 846
Applied a total of 25 rules in 68 ms. Remains 872 /884 variables (removed 12) and now considering 846/859 (removed 13) transitions.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:14:00] [INFO ] Computed 76 place invariants in 4 ms
[2021-05-08 11:14:01] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:14:01] [INFO ] Computed 76 place invariants in 5 ms
[2021-05-08 11:14:01] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
// Phase 1: matrix 846 rows 872 cols
[2021-05-08 11:14:01] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:14:02] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 872/884 places, 846/859 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s763 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-02 finished in 1409 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 884 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 884/884 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 883 transition count 548
Reduce places removed 310 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 347 rules applied. Total rules applied 657 place count 573 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 682 place count 549 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 548 transition count 510
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 683 place count 548 transition count 404
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 895 place count 442 transition count 404
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 899 place count 438 transition count 400
Iterating global reduction 4 with 4 rules applied. Total rules applied 903 place count 438 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 903 place count 438 transition count 397
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 909 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1251 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 4 with 1 rules applied. Total rules applied 1252 place count 263 transition count 201
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 30 rules applied. Total rules applied 1282 place count 242 transition count 192
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1291 place count 233 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 1291 place count 233 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 1315 place count 221 transition count 180
Applied a total of 1315 rules in 68 ms. Remains 221 /884 variables (removed 663) and now considering 180/859 (removed 679) transitions.
// Phase 1: matrix 180 rows 221 cols
[2021-05-08 11:14:02] [INFO ] Computed 55 place invariants in 0 ms
[2021-05-08 11:14:02] [INFO ] Implicit Places using invariants in 101 ms returned [90, 128, 172, 177, 182, 187, 191, 195, 199, 203, 207, 211, 215, 220]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 101 ms to find 14 implicit places.
[2021-05-08 11:14:02] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 180 rows 207 cols
[2021-05-08 11:14:02] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-08 11:14:02] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 207/884 places, 180/859 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 195 transition count 168
Iterating global reduction 0 with 12 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 183 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 183 transition count 156
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 52 place count 181 transition count 154
Applied a total of 52 rules in 38 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:14:02] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-08 11:14:02] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 154 rows 181 cols
[2021-05-08 11:14:02] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-08 11:14:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 11:14:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 181/884 places, 154/859 transitions.
Stuttering acceptance computed with spot in 9569 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:(OR (EQ s154 0) (EQ s85 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 2884 reset in 390 ms.
Product exploration explored 100000 steps with 2877 reset in 339 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2897 reset in 287 ms.
Stack based approach found an accepted trace after 98427 steps with 2840 reset with depth 28 and stack size 28 in 379 ms.
FORMULA AutoFlight-PT-12b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-03 finished in 11570 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 884/884 places, 859/859 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 852
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 873 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 873 transition count 848
Applied a total of 22 rules in 164 ms. Remains 873 /884 variables (removed 11) and now considering 848/859 (removed 11) transitions.
// Phase 1: matrix 848 rows 873 cols
[2021-05-08 11:14:13] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:14:14] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 848 rows 873 cols
[2021-05-08 11:14:14] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:14:14] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
// Phase 1: matrix 848 rows 873 cols
[2021-05-08 11:14:14] [INFO ] Computed 76 place invariants in 3 ms
[2021-05-08 11:14:15] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/884 places, 848/859 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (NEQ s258 0) (NEQ s71 1)), p1:(OR (NEQ s562 0) (NEQ s533 1)), p2:(AND (NEQ s533 0) (NEQ s562 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 182 reset in 237 ms.
Product exploration explored 100000 steps with 182 reset in 263 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1)]
Product exploration explored 100000 steps with 182 reset in 230 ms.
Product exploration explored 100000 steps with 181 reset in 259 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1)]
Support contains 4 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, 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 873 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 873 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 873 transition count 899
Deduced a syphon composed of 402 places in 1 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 414 place count 873 transition count 899
Discarding 223 places :
Symmetric choice reduction at 2 with 223 rule applications. Total rules 637 place count 650 transition count 676
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 2 with 223 rules applied. Total rules applied 860 place count 650 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 1068 place count 650 transition count 652
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1202 place count 516 transition count 518
Deduced a syphon composed of 253 places in 1 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1336 place count 516 transition count 518
Deduced a syphon composed of 253 places in 1 ms
Applied a total of 1336 rules in 172 ms. Remains 516 /873 variables (removed 357) and now considering 518/848 (removed 330) transitions.
[2021-05-08 11:14:16] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 518 rows 516 cols
[2021-05-08 11:14:16] [INFO ] Computed 76 place invariants in 7 ms
[2021-05-08 11:14:17] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 516/873 places, 518/848 transitions.
Product exploration explored 100000 steps with 2038 reset in 529 ms.
Entered a terminal (fully accepting) state of product in 56567 steps with 1147 reset in 294 ms.
FORMULA AutoFlight-PT-12b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-08 finished in 4327 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 884 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 884/884 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 883 transition count 546
Reduce places removed 312 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 349 rules applied. Total rules applied 661 place count 571 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 685 place count 547 transition count 509
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 685 place count 547 transition count 403
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 897 place count 441 transition count 403
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 899 place count 439 transition count 401
Iterating global reduction 3 with 2 rules applied. Total rules applied 901 place count 439 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 901 place count 439 transition count 399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 905 place count 437 transition count 399
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 1249 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 3 with 1 rules applied. Total rules applied 1250 place count 264 transition count 202
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 30 rules applied. Total rules applied 1280 place count 243 transition count 193
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1289 place count 234 transition count 193
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1289 place count 234 transition count 181
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 1313 place count 222 transition count 181
Applied a total of 1313 rules in 76 ms. Remains 222 /884 variables (removed 662) and now considering 181/859 (removed 678) transitions.
// Phase 1: matrix 181 rows 222 cols
[2021-05-08 11:14:18] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-08 11:14:18] [INFO ] Implicit Places using invariants in 95 ms returned [93, 131, 169, 173, 178, 183, 188, 192, 196, 200, 204, 208, 212, 216, 221]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 96 ms to find 15 implicit places.
[2021-05-08 11:14:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 181 rows 207 cols
[2021-05-08 11:14:18] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-08 11:14:18] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Starting structural reductions, iteration 1 : 207/884 places, 181/859 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 194 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 194 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 193 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 193 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 192 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 191 transition count 165
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 34 place count 190 transition count 164
Applied a total of 34 rules in 26 ms. Remains 190 /207 variables (removed 17) and now considering 164/181 (removed 17) transitions.
// Phase 1: matrix 164 rows 190 cols
[2021-05-08 11:14:18] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:14:18] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 164 rows 190 cols
[2021-05-08 11:14:18] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 11:14:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 11:14:18] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 190/884 places, 164/859 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s71 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-09 finished in 578 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.computeTGBA(SpotRunner.java:114)
at fr.lip6.move.gal.application.SpotRunner.transformToTGBA(SpotRunner.java:70)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:156)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Application raised an uncaught exception null
java.lang.NullPointerException
at fr.lip6.move.gal.application.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:291)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:159)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620472470937

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162037990100473"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;