About the Execution of ITS-Tools for BusinessProcesses-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15782.010 | 2645216.00 | 2838477.00 | 210263.70 | ?????????F?????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K Mar 24 05:37 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 BusinessProcesses-PT-06-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1589250923853
[2020-05-12 02:35:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:35:26] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-12 02:35:26] [INFO ] Transformed 376 places.
[2020-05-12 02:35:26] [INFO ] Transformed 297 transitions.
[2020-05-12 02:35:26] [INFO ] Found NUPN structural information;
[2020-05-12 02:35:26] [INFO ] Parsed PT model containing 376 places and 297 transitions in 139 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Incomplete random walk after 100000 steps, including 1037 resets, run finished after 323 ms. (steps per millisecond=309 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 296 rows 375 cols
[2020-05-12 02:35:26] [INFO ] Computed 81 place invariants in 13 ms
[2020-05-12 02:35:26] [INFO ] [Real]Absence check using 42 positive place invariants in 54 ms returned unsat
[2020-05-12 02:35:27] [INFO ] [Real]Absence check using 42 positive place invariants in 37 ms returned unsat
[2020-05-12 02:35:27] [INFO ] [Real]Absence check using 42 positive place invariants in 25 ms returned sat
[2020-05-12 02:35:27] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 36 ms returned sat
[2020-05-12 02:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:27] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2020-05-12 02:35:27] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 17 places in 224 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 14 places in 160 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 24 places in 125 ms
[2020-05-12 02:35:28] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-05-12 02:35:29] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-05-12 02:35:29] [INFO ] Deduced a trap composed of 13 places in 56 ms
[2020-05-12 02:35:29] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-05-12 02:35:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1591 ms
[2020-05-12 02:35:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-05-12 02:35:29] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 23 ms returned sat
[2020-05-12 02:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:29] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 20 places in 249 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 11 places in 269 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 14 places in 105 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 18 places in 131 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 24 places in 68 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-05-12 02:35:32] [INFO ] Deduced a trap composed of 82 places in 541 ms
[2020-05-12 02:35:32] [INFO ] Deduced a trap composed of 15 places in 390 ms
[2020-05-12 02:35:33] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-05-12 02:35:34] [INFO ] Deduced a trap composed of 78 places in 1384 ms
[2020-05-12 02:35:35] [INFO ] Deduced a trap composed of 87 places in 1388 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 82 places in 90 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 78 places in 93 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 80 places in 88 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 78 places in 193 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 83 places in 218 ms
[2020-05-12 02:35:36] [INFO ] Deduced a trap composed of 81 places in 182 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 82 places in 156 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 80 places in 153 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 81 places in 150 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 78 places in 94 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 83 places in 92 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 86 places in 90 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 87 places in 105 ms
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 86 places in 97 ms
[2020-05-12 02:35:38] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2020-05-12 02:35:38] [INFO ] Deduced a trap composed of 81 places in 105 ms
[2020-05-12 02:35:38] [INFO ] Deduced a trap composed of 84 places in 675 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 88 places in 1405 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 81 places in 156 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 89 places in 169 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 87 places in 84 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 81 places in 84 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 80 places in 90 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 82 places in 92 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 85 places in 91 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 84 places in 90 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 81 places in 90 ms
[2020-05-12 02:35:41] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2020-05-12 02:35:42] [INFO ] Deduced a trap composed of 79 places in 1185 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 82 places in 141 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 81 places in 221 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 80 places in 159 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 76 places in 187 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 92 places in 174 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 79 places in 93 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 80 places in 169 ms
[2020-05-12 02:35:44] [INFO ] Deduced a trap composed of 16 places in 173 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 86 places in 147 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 84 places in 162 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 85 places in 73 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 81 places in 176 ms
[2020-05-12 02:35:46] [INFO ] Deduced a trap composed of 78 places in 1185 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 81 places in 278 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 84 places in 188 ms
[2020-05-12 02:35:47] [INFO ] Deduced a trap composed of 86 places in 237 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 78 places in 714 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 78 places in 142 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 77 places in 210 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 76 places in 88 ms
[2020-05-12 02:35:48] [INFO ] Deduced a trap composed of 88 places in 106 ms
[2020-05-12 02:35:49] [INFO ] Deduced a trap composed of 83 places in 203 ms
[2020-05-12 02:35:49] [INFO ] Deduced a trap composed of 78 places in 175 ms
[2020-05-12 02:35:49] [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 closed (> (+ s0 s1 s2 s36 s37 s38 s42 s43 s44 s48 s49 s50 s54 s55 s56 s60 s61 s62 s66 s80 s81 s83 s84 s92 s93 s147 s150 s177 s216 s217 s218 s227 s232 s257 s262 s267 s271 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s289 s290 s291 s292 s293 s294 s295 s296 s299 s300 s311 s312 s315 s316 s317 s318 s323 s324 s325 s326 s329 s330 s332 s333 s340 s341 s344 s372) 0)") while checking expression at index 2
[2020-05-12 02:35:49] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2020-05-12 02:35:49] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 22 ms returned sat
[2020-05-12 02:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:49] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-05-12 02:35:49] [INFO ] Deduced a trap composed of 11 places in 124 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 18 places in 131 ms
[2020-05-12 02:35:51] [INFO ] Deduced a trap composed of 23 places in 107 ms
[2020-05-12 02:35:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1258 ms
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using 42 positive place invariants in 43 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 40 ms returned sat
[2020-05-12 02:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:51] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2020-05-12 02:35:52] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2020-05-12 02:35:52] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-05-12 02:35:52] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 19 places in 896 ms
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 18 places in 487 ms
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-05-12 02:35:55] [INFO ] Deduced a trap composed of 15 places in 1656 ms
[2020-05-12 02:35:57] [INFO ] Deduced a trap composed of 16 places in 2297 ms
[2020-05-12 02:35:59] [INFO ] Deduced a trap composed of 17 places in 1890 ms
[2020-05-12 02:36:02] [INFO ] Deduced a trap composed of 23 places in 2954 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 10 places in 298 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 22 places in 231 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 75 places in 96 ms
[2020-05-12 02:36:03] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2020-05-12 02:36:04] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2020-05-12 02:36:04] [INFO ] Deduced a trap composed of 20 places in 720 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 25 places in 104 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 17 places in 159 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 79 places in 170 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-05-12 02:36:05] [INFO ] Deduced a trap composed of 75 places in 188 ms
[2020-05-12 02:36:06] [INFO ] Deduced a trap composed of 76 places in 185 ms
[2020-05-12 02:36:09] [INFO ] Deduced a trap composed of 82 places in 3750 ms
[2020-05-12 02:36:13] [INFO ] Deduced a trap composed of 78 places in 3746 ms
[2020-05-12 02:36:13] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s30 s31 s32 s42 s43 s44 s60 s61 s62 s66 s74 s75 s92 s93 s97 s99 s100 s128 s172 s176 s177 s178 s181 s182 s183 s186 s188 s212 s217 s227 s251 s252 s253 s257 s262 s267 s271 s274 s275 s276 s277 s278 s279 s280 s281 s282 s285 s286 s289 s290 s295 s296 s297 s298 s299 s300 s305 s306 s311 s312 s323 s324 s325 s326 s329 s330 s336 s337 s340 s341 s344) 0)") while checking expression at index 4
[2020-05-12 02:36:13] [INFO ] [Real]Absence check using 42 positive place invariants in 113 ms returned sat
[2020-05-12 02:36:14] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 54 ms returned sat
[2020-05-12 02:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:36:15] [INFO ] [Real]Absence check using state equation in 1708 ms returned sat
[2020-05-12 02:36:17] [INFO ] Deduced a trap composed of 18 places in 1711 ms
[2020-05-12 02:36:20] [INFO ] Deduced a trap composed of 11 places in 3323 ms
[2020-05-12 02:36:23] [INFO ] Deduced a trap composed of 13 places in 2703 ms
[2020-05-12 02:36:25] [INFO ] Deduced a trap composed of 17 places in 2404 ms
[2020-05-12 02:36:28] [INFO ] Deduced a trap composed of 22 places in 2450 ms
[2020-05-12 02:36:31] [INFO ] Deduced a trap composed of 21 places in 2981 ms
[2020-05-12 02:36:34] [INFO ] Deduced a trap composed of 17 places in 3194 ms
[2020-05-12 02:36:34] [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 closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s63 s67 s68 s69 s70 s82 s186 s187 s188) 0)") while checking expression at index 5
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 02:36:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:36:35] [INFO ] Flatten gal took : 197 ms
[2020-05-12 02:36:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 02:36:35] [INFO ] Flatten gal took : 45 ms
FORMULA BusinessProcesses-PT-06-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:36:35] [INFO ] Applying decomposition
[2020-05-12 02:36:35] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7964053694562120661.txt, -o, /tmp/graph7964053694562120661.bin, -w, /tmp/graph7964053694562120661.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7964053694562120661.bin, -l, -1, -v, -w, /tmp/graph7964053694562120661.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:36:36] [INFO ] Decomposing Gal with order
[2020-05-12 02:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:36:36] [INFO ] Removed a total of 42 redundant transitions.
[2020-05-12 02:36:36] [INFO ] Flatten gal took : 250 ms
[2020-05-12 02:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 02:36:36] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-12 02:36:37] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 59 ordering constraints for composite.
built 14 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 47 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91565e+18,5.21456,161716,21554,29,346620,382,827,476689,45,851,0
Converting to forward existential form...Done !
original formula: (EF((i0.u141.p338==1)) + (!(A((i8.i0.u68.p165==1) U (i11.u75.p180==1))) * !(EF(((i7.i2.u105.p256==1)||(i8.i0.u68.p165==1))))))
=> equivalent forward existential formula: ([(((Init * !(E(TRUE U (i0.u141.p338==1)))) * !(EG(!((i11.u75.p180==1))))) * !(E(!((i11.u75.p180==1)) U (!((i8.i0.u68.p165==1)) * !((i11.u75.p180==1))))))] = FALSE * [(FwdU((Init * !(E(TRUE U (i0.u141.p338==1)))),TRUE) * ((i7.i2.u105.p256==1)||(i8.i0.u68.p165==1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t214, t218, t230, i0.t170, i0.u54.t177, i0.u56.t173, i1.t178, i1.u21.t217, i1.u38.t195, i2.t226, i2.t222, i2.u13.t233, i2.u15.t229, i2.u17.t225, i3.t238, i3.t234, i3.u7.t244, i3.u9.t241, i3.u11.t237, i4.i0.u23.t213, i6.i1.u58.t169, i6.i2.t132, i6.i2.u87.t133, i7.i1.t108, i7.i1.u99.t109, i7.i2.t96, i7.i2.u105.t97, i7.i3.t92, i7.i3.u108.t93, i8.i2.t152, i8.i2.u77.t153, i8.i3.t136, i8.i3.u85.t137, i9.t163, i9.u71.t164, i10.t160, i10.u73.t161, i11.t156, i11.u76.t157, i12.t148, i12.u80.t149, i13.t144, i13.u82.t145, i14.t140, i14.u83.t141, i15.t124, i15.u91.t125, i16.t120, i16.u94.t121, i17.i0.u19.t221, i17.i1.t100, i17.i1.u103.t101, i18.i0.t128, i18.i0.u89.t129, i18.i1.t116, i18.i1.u96.t117, i18.i2.t112, i18.i2.u98.t113, i19.t104, i19.u101.t105, i20.t88, i20.u109.t89, i21.t82, i21.t69, i21.t66, i21.t63, i21.t60, i21.t57, i21.t54, i21.t51, i21.t48, i21.t45, i21.t43, i21.t41, i21.t39, i21.t37, i21.t35, i21.t33, i21.t31, i21.t12, i21.t9, i21.t6, i21.u114.t4, i21.u114.t29, i21.u114.t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/211/85/296
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2020-05-12 02:37:59] [INFO ] Applying decomposition
[2020-05-12 02:37:59] [INFO ] Flatten gal took : 21 ms
[2020-05-12 02:37:59] [INFO ] Decomposing Gal with order
[2020-05-12 02:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:37:59] [INFO ] Flatten gal took : 59 ms
[2020-05-12 02:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2020-05-12 02:37:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 33 ms
[2020-05-12 02:37:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 2 ordering constraints for composite.
built 82 ordering constraints for composite.
built 42 ordering constraints for composite.
built 41 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 27 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 42 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 02:58:30] [INFO ] Flatten gal took : 765 ms
[2020-05-12 02:58:32] [INFO ] Input system was already deterministic with 296 transitions.
[2020-05-12 02:58:32] [INFO ] Transformed 375 places.
[2020-05-12 02:58:32] [INFO ] Transformed 296 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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
[2020-05-12 02:59:02] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 16 ms
[2020-05-12 02:59:02] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
BK_STOP 1589253569069
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="BusinessProcesses-PT-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 BusinessProcesses-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;