About the Execution of ITS-Tools for BusinessProcesses-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15717.710 | 114143.00 | 143692.00 | 79.80 | TTTFFTFTFTFTFFTT | 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-158897699100484.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-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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-05-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1589250794526
[2020-05-12 02:33:17] [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:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:33:17] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-05-12 02:33:17] [INFO ] Transformed 368 places.
[2020-05-12 02:33:17] [INFO ] Transformed 319 transitions.
[2020-05-12 02:33:17] [INFO ] Found NUPN structural information;
[2020-05-12 02:33:17] [INFO ] Parsed PT model containing 368 places and 319 transitions in 113 ms.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Incomplete random walk after 100000 steps, including 919 resets, run finished after 369 ms. (steps per millisecond=271 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:33:17] [INFO ] Computed 57 place invariants in 17 ms
[2020-05-12 02:33:18] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2020-05-12 02:33:18] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:18] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 91 places in 145 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 12 places in 102 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-05-12 02:33:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 606 ms
[2020-05-12 02:33:19] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned sat
[2020-05-12 02:33:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:19] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 15 places in 98 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 86 places in 93 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 94 places in 85 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 13 places in 82 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 15 places in 111 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 14 places in 81 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 99 places in 99 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 87 places in 74 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 92 places in 74 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 94 places in 158 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 90 places in 87 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 94 places in 93 ms
[2020-05-12 02:33:23] [INFO ] Deduced a trap composed of 93 places in 2108 ms
[2020-05-12 02:33:23] [INFO ] Deduced a trap composed of 93 places in 86 ms
[2020-05-12 02:33:23] [INFO ] Deduced a trap composed of 22 places in 102 ms
[2020-05-12 02:33:23] [INFO ] Deduced a trap composed of 92 places in 94 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 24 places in 64 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 98 places in 70 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 95 places in 68 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 95 places in 65 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 93 places in 72 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 37 places in 66 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 86 places in 62 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 88 places in 62 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 95 places in 78 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 46 places in 72 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 93 places in 69 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 93 places in 73 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 87 places in 70 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 91 places in 69 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 94 places in 69 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 96 places in 72 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 97 places in 74 ms
[2020-05-12 02:33:28] [INFO ] Deduced a trap composed of 32 places in 2493 ms
[2020-05-12 02:33:28] [INFO ] Deduced a trap composed of 96 places in 82 ms
[2020-05-12 02:33:28] [INFO ] Deduced a trap composed of 88 places in 88 ms
[2020-05-12 02:33:28] [INFO ] Deduced a trap composed of 91 places in 183 ms
[2020-05-12 02:33:29] [INFO ] Deduced a trap composed of 87 places in 137 ms
[2020-05-12 02:33:29] [INFO ] Deduced a trap composed of 88 places in 174 ms
[2020-05-12 02:33:29] [INFO ] Deduced a trap composed of 94 places in 165 ms
[2020-05-12 02:33:31] [INFO ] Deduced a trap composed of 97 places in 2141 ms
[2020-05-12 02:33:35] [INFO ] Deduced a trap composed of 33 places in 4308 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 95 places in 68 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 31 places in 70 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 100 places in 70 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 91 places in 71 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 96 places in 72 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 92 places in 70 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 90 places in 71 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 92 places in 70 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 96 places in 71 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 94 places in 69 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 38 places in 75 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 93 places in 69 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 97 places in 66 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 96 places in 72 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 35 places in 70 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 97 places in 72 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 96 places in 69 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 97 places in 68 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 42 places in 76 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 101 places in 71 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 100 places in 67 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 95 places in 69 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 100 places in 67 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 96 places in 69 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 98 places in 72 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 97 places in 69 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 97 places in 71 ms
[2020-05-12 02:33:38] [INFO ] Deduced a trap composed of 92 places in 70 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 91 places in 72 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 91 places in 75 ms
[2020-05-12 02:33:39] [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 s33 s34 s37 s38 s44 s45 s47 s48 s51 s60 s61 s62 s63 s68 s69 s106 s107 s108 s118 s119 s120 s158 s163 s168 s178 s192 s194 s198 s208 s213 s218 s223 s227 s228 s229 s238 s263 s266 s267 s268 s269 s270 s271 s272 s273 s274 s279 s280 s285 s286 s294 s295 s296 s297 s304 s305 s306 s307 s308 s309 s310 s324 s325 s326 s327 s330 s331 s334 s335 s336 s337 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s352 s353 s354 s355 s360 s361 s362 s363 s366) 0)") while checking expression at index 1
[2020-05-12 02:33:39] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2020-05-12 02:33:39] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:39] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 32 places in 56 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 17 places in 49 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 31 places in 47 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 41 places in 47 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 35 places in 46 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 44 places in 45 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2020-05-12 02:33:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 655 ms
[2020-05-12 02:33:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:40] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2020-05-12 02:33:40] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:40] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 32 places in 80 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 38 places in 49 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 41 places in 64 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 44 places in 63 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 15 places in 36 ms
[2020-05-12 02:33:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 816 ms
[2020-05-12 02:33:41] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 14 ms.
[2020-05-12 02:33:42] [INFO ] Added : 159 causal constraints over 32 iterations in 827 ms. Result :sat
[2020-05-12 02:33:42] [INFO ] [Real]Absence check using 41 positive place invariants in 40 ms returned sat
[2020-05-12 02:33:42] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:42] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2020-05-12 02:33:42] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-05-12 02:33:42] [INFO ] Deduced a trap composed of 11 places in 44 ms
[2020-05-12 02:33:42] [INFO ] Deduced a trap composed of 14 places in 66 ms
[2020-05-12 02:33:42] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 28 places in 39 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 22 places in 37 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 20 places in 36 ms
[2020-05-12 02:33:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 780 ms
[2020-05-12 02:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2020-05-12 02:33:43] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:43] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 22 places in 53 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 22 places in 52 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 43 places in 52 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 36 places in 62 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-05-12 02:33:45] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-05-12 02:33:45] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2020-05-12 02:33:45] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1255 ms
[2020-05-12 02:33:45] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 14 ms.
[2020-05-12 02:33:46] [INFO ] Added : 200 causal constraints over 40 iterations in 939 ms. Result :sat
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using state equation in 191 ms returned unsat
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:46] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2020-05-12 02:33:46] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-12 02:33:46] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2020-05-12 02:33:46] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 24 places in 45 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 24 places in 51 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 51 places in 75 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 34 places in 45 ms
[2020-05-12 02:33:47] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2020-05-12 02:33:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1109 ms
[2020-05-12 02:33:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:47] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2020-05-12 02:33:47] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:48] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 90 places in 100 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 33 places in 96 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 38 places in 49 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 25 places in 59 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 94 places in 65 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2020-05-12 02:33:49] [INFO ] Deduced a trap composed of 20 places in 20 ms
[2020-05-12 02:33:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1333 ms
[2020-05-12 02:33:49] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-05-12 02:33:50] [INFO ] Added : 237 causal constraints over 48 iterations in 1177 ms. Result :sat
[2020-05-12 02:33:50] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-05-12 02:33:50] [INFO ] Deduced a trap composed of 90 places in 62 ms
[2020-05-12 02:33:50] [INFO ] Deduced a trap composed of 98 places in 65 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 92 places in 62 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 100 places in 57 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 94 places in 73 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 90 places in 58 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 96 places in 58 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 92 places in 63 ms
[2020-05-12 02:33:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1066 ms
[2020-05-12 02:33:51] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-05-12 02:33:51] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-12 02:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:52] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 36 places in 84 ms
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 11 places in 90 ms
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 86 places in 82 ms
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-05-12 02:33:52] [INFO ] Deduced a trap composed of 21 places in 95 ms
[2020-05-12 02:33:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 601 ms
[2020-05-12 02:33:52] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2020-05-12 02:33:52] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:53] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 86 places in 126 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 8 places in 76 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-05-12 02:33:53] [INFO ] Deduced a trap composed of 85 places in 84 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 91 places in 86 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 90 places in 78 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 90 places in 134 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 31 places in 136 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 38 places in 69 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 36 places in 70 ms
[2020-05-12 02:33:54] [INFO ] Deduced a trap composed of 25 places in 67 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 32 places in 67 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 96 places in 75 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 88 places in 78 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 99 places in 67 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 96 places in 62 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 95 places in 76 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 95 places in 62 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 97 places in 78 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 91 places in 78 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 101 places in 60 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 97 places in 63 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 99 places in 67 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 92 places in 65 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 96 places in 62 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 37 places in 62 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 99 places in 58 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 94 places in 66 ms
[2020-05-12 02:33:56] [INFO ] Deduced a trap composed of 86 places in 61 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 83 places in 60 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 89 places in 60 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 96 places in 66 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 23 places in 58 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 94 places in 61 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 91 places in 60 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 95 places in 57 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 96 places in 60 ms
[2020-05-12 02:33:57] [INFO ] Deduced a trap composed of 91 places in 70 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 97 places in 71 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 94 places in 70 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 97 places in 68 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 93 places in 69 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 92 places in 67 ms
[2020-05-12 02:33:58] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 5478 ms
[2020-05-12 02:33:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 67 ms returned sat
[2020-05-12 02:33:58] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:58] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 15 places in 73 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 15 places in 73 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-05-12 02:33:59] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 39 places in 67 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 91 places in 71 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 32 places in 65 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 31 places in 61 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-05-12 02:34:00] [INFO ] Deduced a trap composed of 92 places in 67 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 90 places in 65 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 98 places in 86 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 98 places in 63 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 92 places in 64 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 96 places in 63 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 94 places in 63 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 93 places in 63 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 94 places in 63 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 96 places in 63 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 94 places in 68 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 99 places in 65 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 94 places in 65 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 91 places in 61 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 21 places in 65 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 95 places in 63 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 47 places in 65 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 93 places in 62 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 94 places in 62 ms
[2020-05-12 02:34:02] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 88 places in 67 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 89 places in 61 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 88 places in 60 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 88 places in 74 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 92 places in 64 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 87 places in 61 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 34 places in 65 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-05-12 02:34:03] [INFO ] Deduced a trap composed of 95 places in 67 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 92 places in 59 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 95 places in 71 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 97 places in 67 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 97 places in 69 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 33 places in 65 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 91 places in 72 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 21 places in 64 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 90 places in 66 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-05-12 02:34:04] [INFO ] Deduced a trap composed of 92 places in 59 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 94 places in 58 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 88 places in 58 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 91 places in 63 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 93 places in 64 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 89 places in 63 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 95 places in 68 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 88 places in 60 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 88 places in 69 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 100 places in 66 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 105 places in 73 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 88 places in 69 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 53 places in 102 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 56 places in 63 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 112 places in 63 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 20 places in 74 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 92 places in 67 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 89 places in 70 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 95 places in 77 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 103 places in 64 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 91 places in 63 ms
[2020-05-12 02:34:06] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 92 places in 65 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 95 places in 59 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 90 places in 67 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 92 places in 68 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 90 places in 64 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 87 places in 61 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 95 places in 60 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 83 places in 60 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 83 places in 61 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 85 places in 61 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 87 places in 84 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 90 places in 71 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 85 places in 64 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 87 places in 87 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 81 places in 72 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 94 places in 73 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 88 places in 64 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 87 places in 70 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 89 places in 67 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 85 places in 66 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 88 places in 66 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 90 places in 67 ms
[2020-05-12 02:34:08] [INFO ] Deduced a trap composed of 87 places in 69 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 59 places in 64 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 87 places in 58 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 99 places in 71 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 93 places in 62 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 93 places in 64 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 83 places in 64 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 94 places in 78 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 98 places in 63 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 85 places in 60 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-12 02:34:09] [INFO ] Deduced a trap composed of 99 places in 63 ms
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 89 places in 62 ms
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 92 places in 76 ms
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 91 places in 73 ms
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 88 places in 76 ms
[2020-05-12 02:34:10] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-05-12 02:34:10] [INFO ] Trap strengthening (SAT) tested/added 147/146 trap constraints in 11544 ms
[2020-05-12 02:34:10] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-05-12 02:34:11] [INFO ] Added : 187 causal constraints over 38 iterations in 994 ms. Result :sat
[2020-05-12 02:34:11] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2020-05-12 02:34:11] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:11] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2020-05-12 02:34:11] [INFO ] Deduced a trap composed of 11 places in 77 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 88 places in 66 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 20 places in 67 ms
[2020-05-12 02:34:12] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 91 places in 67 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 89 places in 67 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 15 places in 71 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 90 places in 71 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 26 places in 102 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 96 places in 61 ms
[2020-05-12 02:34:13] [INFO ] Deduced a trap composed of 86 places in 59 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 92 places in 77 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 91 places in 58 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 88 places in 58 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 92 places in 65 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 89 places in 63 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 89 places in 59 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 87 places in 60 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 85 places in 57 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 87 places in 56 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 90 places in 54 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 87 places in 54 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 86 places in 53 ms
[2020-05-12 02:34:14] [INFO ] Deduced a trap composed of 89 places in 53 ms
[2020-05-12 02:34:14] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 3062 ms
[2020-05-12 02:34:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2020-05-12 02:34:14] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:15] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 84 places in 72 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 81 places in 62 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-05-12 02:34:15] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 15 places in 40 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 20 places in 37 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 45 places in 35 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2020-05-12 02:34:16] [INFO ] Deduced a trap composed of 40 places in 29 ms
[2020-05-12 02:34:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1142 ms
[2020-05-12 02:34:16] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 14 ms.
[2020-05-12 02:34:17] [INFO ] Added : 245 causal constraints over 50 iterations in 1286 ms. Result :sat
[2020-05-12 02:34:17] [INFO ] Deduced a trap composed of 97 places in 65 ms
[2020-05-12 02:34:17] [INFO ] Deduced a trap composed of 96 places in 65 ms
[2020-05-12 02:34:17] [INFO ] Deduced a trap composed of 92 places in 66 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 94 places in 68 ms
[2020-05-12 02:34:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 527 ms
[2020-05-12 02:34:18] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-05-12 02:34:18] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:18] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 10 places in 73 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 13 places in 73 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-05-12 02:34:18] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 28 places in 70 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 41 places in 71 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 12 places in 71 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 18 places in 71 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 96 places in 67 ms
[2020-05-12 02:34:19] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-12 02:34:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 978 ms
[2020-05-12 02:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 17 ms returned unsat
[2020-05-12 02:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-12 02:34:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-12 02:34:19] [INFO ] Flatten gal took : 47 ms
[2020-05-12 02:34:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-12 02:34:19] [INFO ] Flatten gal took : 16 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:34:19] [INFO ] Applying decomposition
[2020-05-12 02:34:19] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16257037713617979855.txt, -o, /tmp/graph16257037713617979855.bin, -w, /tmp/graph16257037713617979855.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/graph16257037713617979855.bin, -l, -1, -v, -w, /tmp/graph16257037713617979855.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:34:19] [INFO ] Decomposing Gal with order
[2020-05-12 02:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:34:20] [INFO ] Removed a total of 70 redundant transitions.
[2020-05-12 02:34:20] [INFO ] Flatten gal took : 44 ms
[2020-05-12 02:34:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-12 02:34:20] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2020-05-12 02:34:20] [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 14 CTL formulae.
built 58 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 49 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 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.38391e+17,0.345441,19068,2358,24,25398,468,781,55402,49,736,0
Converting to forward existential form...Done !
original formula: EF((i1.i1.u64.p160==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i1.i1.u64.p160==1))] != FALSE
(forward)formula 0,1,0.349955,19388,1,0,25398,468,786,55402,52,736,1011
FORMULA BusinessProcesses-PT-05-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((i5.u26.p65==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i5.u26.p65==1))] != FALSE
(forward)formula 1,1,0.350829,19388,1,0,25398,468,788,55402,52,736,1625
FORMULA BusinessProcesses-PT-05-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((AX((i19.u140.p339==1)) + EG((i10.i4.u72.p177==1))) U EF(((i7.i2.u100.p247==1)&&(i19.u149.p357==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i7.i2.u100.p247==1)&&(i19.u149.p357==1))))))) * !(E(!(E(TRUE U ((i7.i2.u100.p247==1)&&(i19.u149.p357==1)))) U (!((!(EX(!((i19.u140.p339==1)))) + EG((i10.i4.u72.p177==1)))) * !(E(TRUE U ((i7.i2.u100.p247==1)&&(i19.u149.p357==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t182, t244, t256, i0.i0.u29.t223, i0.i1.t128, i0.i1.u89.t129, i1.i0.t259, i1.i0.u10.t261, i1.i1.t175, i1.i1.u65.t176, i2.t255, i2.u15.t251, i3.t62, i3.u116.t66, i4.i0.t250, i4.i0.u8.t264, i4.i0.u14.t253, i4.i0.u20.t241, i4.i1.t243, i4.i1.u21.t239, i5.t233, i5.t231, i5.t229, i5.u27.t227, i5.u28.t225, i6.i1.u48.t185, i6.i1.u50.t181, i7.i1.t108, i7.i1.u99.t109, i7.i2.t104, i7.i2.u100.t105, i7.i3.t96, i7.i3.u104.t97, i8.i1.t132, i8.i1.u87.t133, i8.i2.t120, i8.i2.u92.t121, i8.i3.t116, i8.i3.u94.t117, i9.i1.t152, i9.i1.u77.t153, i9.i2.t144, i9.i2.u80.t145, i9.i3.t140, i9.i3.u83.t141, i9.i4.t136, i9.i4.u85.t137, i10.i1.t172, i10.i1.u66.t173, i10.i2.t168, i10.i2.u69.t169, i10.i3.t164, i10.i3.u71.t165, i10.i4.t160, i10.i4.u72.t161, i11.i0.t249, i11.i0.u17.t247, i11.i1.t156, i11.i1.u75.t157, i12.i0.u46.t189, i12.i1.t92, i12.i1.u106.t93, i13.i0.u22.t237, i13.i1.t148, i13.i1.u79.t149, i14.t51, i14.u122.t55, i15.i0.u40.t201, i15.i1.t217, i15.i1.u31.t219, i15.i2.t112, i15.i2.u96.t113, i16.i0.t205, i16.i0.u37.t207, i16.i1.t124, i16.i1.u90.t125, i17.i0.t211, i17.i0.u34.t213, i17.i1.t100, i17.i1.u103.t101, i18.u42.t197, i18.u44.t193, i19.t76, i19.t74, i19.t71, i19.t69, i19.t64, i19.t60, i19.t58, i19.t53, i19.t49, i19.t40, i19.t36, i19.t33, i19.t31, i19.t28, i19.t26, i19.t23, i19.t21, i19.t18, i19.t15, i19.t12, i19.t9, i19.t6, i19.t3, i19.u108.t1, i20.t44, i20.t42, i20.t38, i20.u127.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/208/110/318
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 2,0,23.378,559268,1,0,841967,547,5158,1.91653e+06,260,769,1112362
FORMULA BusinessProcesses-PT-05-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((i10.i0.u62.p152!=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((i10.i0.u62.p152!=1)))] = FALSE
(forward)formula 3,0,23.383,559532,1,0,842345,547,5163,1.91715e+06,260,769,1113281
FORMULA BusinessProcesses-PT-05-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(((EF((i11.i1.u74.p181==1)) + AX((i8.i2.u92.p227==1))) + A((i18.u2.p7==1) U (((i1.i1.u9.p22==1)&&(i1.i1.u65.p159==1))&&(i4.i0.u112.p280==1)))))
=> equivalent forward existential formula: (([(FwdU(EY(Init),TRUE) * (i11.i1.u74.p181==1))] != FALSE + [(EY(Init) * !(EX(!((i8.i2.u92.p227==1)))))] != FALSE) + [((EY(Init) * !(EG(!((((i1.i1.u9.p22==1)&&(i1.i1.u65.p159==1))&&(i4.i0.u112.p280==1)))))) * !(E(!((((i1.i1.u9.p22==1)&&(i1.i1.u65.p159==1))&&(i4.i0.u112.p280==1))) U (!((i18.u2.p7==1)) * !((((i1.i1.u9.p22==1)&&(i1.i1.u65.p159==1))&&(i4.i0.u112.p280==1)))))))] != FALSE)
(forward)formula 4,1,23.6899,569564,1,0,858183,740,5901,1.96404e+06,281,1144,1168402
FORMULA BusinessProcesses-PT-05-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(AG(EF((i11.i1.u75.p182==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (i11.i1.u75.p182==1))))))] != FALSE
(forward)formula 5,0,24.2737,589100,1,0,888074,740,5904,2.03218e+06,281,1144,1214182
FORMULA BusinessProcesses-PT-05-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(EX((((i12.i0.u47.p118==1)&&(i12.i1.u106.p264==1))&&(i12.i0.u150.p359==1)))) * EG((i8.i2.u93.p226!=1)))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U EX((((i12.i0.u47.p118==1)&&(i12.i1.u106.p264==1))&&(i12.i0.u150.p359==1))))),(i8.i2.u93.p226!=1))] != FALSE
(forward)formula 6,1,24.5531,597284,1,0,907066,740,5957,2.06336e+06,282,1145,1249285
FORMULA BusinessProcesses-PT-05-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((((i18.u42.p105!=1)&&(i13.i0.u23.p57!=1))||(i16.i1.u91.p221!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i18.u42.p105!=1)&&(i13.i0.u23.p57!=1))||(i16.i1.u91.p221!=1))))] = FALSE
(forward)formula 7,0,24.56,597548,1,0,907366,740,5970,2.06386e+06,284,1145,1249879
FORMULA BusinessProcesses-PT-05-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF((EG((i6.i1.u51.p130==1)) + AX((((i4.i0.u8.p19==1)&&(i10.i3.u71.p173==1))&&(i19.u108.p367==1))))) * (EF((i13.i1.u79.p192==1)) + !(AF((i19.u108.p266==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * E(TRUE U (EG((i6.i1.u51.p130==1)) + !(EX(!((((i4.i0.u8.p19==1)&&(i10.i3.u71.p173==1))&&(i19.u108.p367==1)))))))),TRUE) * (i13.i1.u79.p192==1))] != FALSE + [FwdG((Init * E(TRUE U (EG((i6.i1.u51.p130==1)) + !(EX(!((((i4.i0.u8.p19==1)&&(i10.i3.u71.p173==1))&&(i19.u108.p367==1)))))))),!((i19.u108.p266==1)))] != FALSE)
(forward)formula 8,1,47.8265,1070184,1,0,1.55567e+06,752,5997,3.53198e+06,285,1201,1982614
FORMULA BusinessProcesses-PT-05-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((!(EX((i19.u140.p339==1))) + EX(((((i12.i0.u47.p118==1)&&(i12.i1.u106.p264==1))&&(i12.i0.u150.p359==1))||(i18.u2.p5==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(((((i12.i0.u47.p118==1)&&(i12.i1.u106.p264==1))&&(i12.i0.u150.p359==1))||(i18.u2.p5==1)))))) * (i19.u140.p339==1))] = FALSE
(forward)formula 9,0,47.9122,1072296,1,0,1.55946e+06,752,5999,3.54251e+06,285,1201,1990874
FORMULA BusinessProcesses-PT-05-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((E((i3.u116.p289==1) U (i12.i0.u47.p119==1)) * AF((i16.i0.u37.p91!=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E((i3.u116.p289==1) U (i12.i0.u47.p119==1))) * !(EG(!((i16.i0.u37.p91!=1)))))] != FALSE
(forward)formula 10,1,48.0111,1074408,1,0,1.56401e+06,752,6076,3.54747e+06,285,1201,1998046
FORMULA BusinessProcesses-PT-05-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((((i6.i1.u48.p122==1)&&(i16.i0.u39.p96==1)) * EG((i5.u25.p63==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((i6.i1.u48.p122==1)&&(i16.i0.u39.p96==1))),(i5.u25.p63==1))] != FALSE
(forward)formula 11,0,48.0132,1074672,1,0,1.56401e+06,752,6093,3.54749e+06,285,1201,1998810
FORMULA BusinessProcesses-PT-05-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(EF((i19.u140.p339==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i19.u140.p339==1))] = FALSE
(forward)formula 12,0,48.0136,1074672,1,0,1.56401e+06,752,6093,3.5475e+06,285,1201,1998810
FORMULA BusinessProcesses-PT-05-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((i6.u49.p126==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i6.u49.p126==1))] != FALSE
(forward)formula 13,1,48.0144,1074672,1,0,1.56401e+06,752,6095,3.54754e+06,285,1201,1998971
FORMULA BusinessProcesses-PT-05-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1589250908669
--------------------
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-05"
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-05, 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-158897699100484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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 ;