fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200572
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.180 3600000.00 4024414.00 150768.00 TTTFTFFTTTTFFTF? 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-158897699200572.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-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:45 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.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 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:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:38 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 159K 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-16-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589255841693

[2020-05-12 03:57:25] [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 03:57:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:57:26] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-05-12 03:57:26] [INFO ] Transformed 638 places.
[2020-05-12 03:57:26] [INFO ] Transformed 578 transitions.
[2020-05-12 03:57:26] [INFO ] Found NUPN structural information;
[2020-05-12 03:57:26] [INFO ] Parsed PT model containing 638 places and 578 transitions in 206 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 67 ms.
Incomplete random walk after 100000 steps, including 666 resets, run finished after 538 ms. (steps per millisecond=185 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 03:57:26] [INFO ] Computed 100 place invariants in 48 ms
[2020-05-12 03:57:27] [INFO ] [Real]Absence check using 62 positive place invariants in 288 ms returned sat
[2020-05-12 03:57:27] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 150 ms returned sat
[2020-05-12 03:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:29] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 13 places in 797 ms
[2020-05-12 03:57:30] [INFO ] Deduced a trap composed of 18 places in 713 ms
[2020-05-12 03:57:31] [INFO ] Deduced a trap composed of 17 places in 420 ms
[2020-05-12 03:57:31] [INFO ] Deduced a trap composed of 12 places in 427 ms
[2020-05-12 03:57:32] [INFO ] Deduced a trap composed of 8 places in 250 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 144 places in 5542 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 125 places in 216 ms
[2020-05-12 03:57:38] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 135 places in 3358 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 14 places in 447 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 29 places in 1063 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 15 places in 416 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 39 places in 232 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 23 places in 195 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 24 places in 305 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 15 places in 305 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 124 places in 333 ms
[2020-05-12 03:57:50] [INFO ] Deduced a trap composed of 44 places in 4977 ms
[2020-05-12 03:57:50] [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 s8 s51 s52 s63 s64 s67 s154 s155 s156 s223 s290 s295 s303 s308 s323 s327 s328 s329 s333 s338 s343 s353 s422 s423 s424 s464 s465 s468 s492 s493 s505 s506 s556 s557 s583 s584) 0)") while checking expression at index 0
[2020-05-12 03:57:50] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned unsat
[2020-05-12 03:57:50] [INFO ] [Real]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-05-12 03:57:50] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 5 ms returned unsat
[2020-05-12 03:57:50] [INFO ] [Real]Absence check using 62 positive place invariants in 396 ms returned sat
[2020-05-12 03:57:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 242 ms returned sat
[2020-05-12 03:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:52] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2020-05-12 03:57:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 113 ms returned sat
[2020-05-12 03:57:52] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 85 ms returned sat
[2020-05-12 03:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:56] [INFO ] [Nat]Absence check using state equation in 4110 ms returned sat
[2020-05-12 03:58:03] [INFO ] Deduced a trap composed of 13 places in 6460 ms
[2020-05-12 03:58:08] [INFO ] Deduced a trap composed of 14 places in 5334 ms
[2020-05-12 03:58:12] [INFO ] Deduced a trap composed of 18 places in 3140 ms
[2020-05-12 03:58:12] [INFO ] Deduced a trap composed of 12 places in 750 ms
[2020-05-12 03:58:12] [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 s238 s239 s240 s247 s250 s437 s438 s439 s443) 0)") while checking expression at index 3
[2020-05-12 03:58:12] [INFO ] [Real]Absence check using 62 positive place invariants in 46 ms returned sat
[2020-05-12 03:58:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 03:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:13] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2020-05-12 03:58:14] [INFO ] Deduced a trap composed of 16 places in 569 ms
[2020-05-12 03:58:14] [INFO ] Deduced a trap composed of 128 places in 212 ms
[2020-05-12 03:58:14] [INFO ] Deduced a trap composed of 8 places in 257 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 30 places in 201 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 77 places in 182 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 12 places in 182 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 18 places in 364 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 110 places in 197 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 18 places in 220 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 14 places in 169 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 37 places in 165 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 18 places in 202 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 61 places in 164 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 127 places in 290 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 126 places in 291 ms
[2020-05-12 03:58:18] [INFO ] Deduced a trap composed of 66 places in 279 ms
[2020-05-12 03:58:18] [INFO ] Deduced a trap composed of 139 places in 212 ms
[2020-05-12 03:58:18] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-05-12 03:58:18] [INFO ] Deduced a trap composed of 148 places in 162 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 153 places in 167 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 136 places in 166 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 142 places in 142 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 138 places in 160 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 142 places in 139 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 140 places in 142 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 141 places in 146 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 150 places in 142 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 132 places in 144 ms
[2020-05-12 03:58:20] [INFO ] Deduced a trap composed of 145 places in 145 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 141 places in 142 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 134 places in 156 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 35 places in 140 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 135 places in 143 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 141 places in 136 ms
[2020-05-12 03:58:21] [INFO ] Deduced a trap composed of 143 places in 138 ms
[2020-05-12 03:58:22] [INFO ] Deduced a trap composed of 152 places in 140 ms
[2020-05-12 03:58:22] [INFO ] Deduced a trap composed of 142 places in 139 ms
[2020-05-12 03:58:22] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-05-12 03:58:22] [INFO ] Deduced a trap composed of 27 places in 43 ms
[2020-05-12 03:58:22] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 8722 ms
[2020-05-12 03:58:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:58:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-05-12 03:58:22] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 40 ms returned sat
[2020-05-12 03:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:26] [INFO ] [Nat]Absence check using state equation in 3882 ms returned sat
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 16 places in 8422 ms
[2020-05-12 03:58:40] [INFO ] Deduced a trap composed of 8 places in 5368 ms
[2020-05-12 03:58:41] [INFO ] Deduced a trap composed of 11 places in 1183 ms
[2020-05-12 03:58:41] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-05-12 03:58:42] [INFO ] Deduced a trap composed of 16 places in 249 ms
[2020-05-12 03:58:42] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-05-12 03:58:42] [INFO ] Deduced a trap composed of 41 places in 175 ms
[2020-05-12 03:58:42] [INFO ] Deduced a trap composed of 137 places in 168 ms
[2020-05-12 03:58:42] [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 s29 s30 s31 s32 s35 s74 s75 s114 s115 s116 s125 s126 s127 s148 s149 s150 s154 s155 s156 s175 s180 s183 s187 s188 s205 s232 s233 s234 s247 s250 s290 s295 s308 s317 s319 s323 s327 s328 s329 s333 s338 s348 s367 s369 s373 s377 s378 s379 s382 s384 s392 s393 s394 s397 s398 s399 s408 s413 s432 s434 s438 s447 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s468 s469 s470 s479 s480 s483 s484 s485 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s502 s515 s516 s519 s520 s523 s524 s534 s535 s540 s541 s542 s543 s546 s547 s550 s551 s552 s553 s554 s555 s556 s557 s559 s561 s565 s572 s573 s574 s577 s578 s583 s584 s591 s592 s593 s594 s595 s602 s603 s612 s624) 0)") while checking expression at index 4
[2020-05-12 03:58:42] [INFO ] [Real]Absence check using 62 positive place invariants in 50 ms returned sat
[2020-05-12 03:58:42] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:45] [INFO ] [Real]Absence check using state equation in 3106 ms returned sat
[2020-05-12 03:58:48] [INFO ] Deduced a trap composed of 39 places in 2158 ms
[2020-05-12 03:58:48] [INFO ] Deduced a trap composed of 18 places in 210 ms
[2020-05-12 03:58:50] [INFO ] Deduced a trap composed of 127 places in 2350 ms
[2020-05-12 03:58:51] [INFO ] Deduced a trap composed of 15 places in 384 ms
[2020-05-12 03:58:51] [INFO ] Deduced a trap composed of 14 places in 390 ms
[2020-05-12 03:58:52] [INFO ] Deduced a trap composed of 8 places in 362 ms
[2020-05-12 03:58:53] [INFO ] Deduced a trap composed of 141 places in 1044 ms
[2020-05-12 03:58:57] [INFO ] Deduced a trap composed of 11 places in 4224 ms
[2020-05-12 03:59:05] [INFO ] Deduced a trap composed of 20 places in 8233 ms
[2020-05-12 03:59:05] [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 s67 s68 s247 s250 s337 s338 s339 s343 s348 s438 s443 s583 s584 s587 s588 s591 s592) 0)") while checking expression at index 5
[2020-05-12 03:59:05] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2020-05-12 03:59:05] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 48 ms returned sat
[2020-05-12 03:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:07] [INFO ] [Real]Absence check using state equation in 1505 ms returned unsat
[2020-05-12 03:59:07] [INFO ] [Real]Absence check using 62 positive place invariants in 116 ms returned sat
[2020-05-12 03:59:07] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 32 ms returned sat
[2020-05-12 03:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:11] [INFO ] [Real]Absence check using state equation in 3899 ms returned sat
[2020-05-12 03:59:16] [INFO ] Deduced a trap composed of 13 places in 4643 ms
[2020-05-12 03:59:20] [INFO ] Deduced a trap composed of 25 places in 4196 ms
[2020-05-12 03:59:20] [INFO ] Deduced a trap composed of 12 places in 298 ms
[2020-05-12 03:59:21] [INFO ] Deduced a trap composed of 12 places in 244 ms
[2020-05-12 03:59:21] [INFO ] Deduced a trap composed of 18 places in 246 ms
[2020-05-12 03:59:21] [INFO ] Deduced a trap composed of 13 places in 284 ms
[2020-05-12 03:59:21] [INFO ] Deduced a trap composed of 16 places in 221 ms
[2020-05-12 03:59:22] [INFO ] Deduced a trap composed of 33 places in 227 ms
[2020-05-12 03:59:22] [INFO ] Deduced a trap composed of 38 places in 708 ms
[2020-05-12 03:59:29] [INFO ] Deduced a trap composed of 37 places in 6761 ms
[2020-05-12 03:59:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s37 s38 s39 s44 s45 s299 s312 s313 s314) 0)") while checking expression at index 7
[2020-05-12 03:59:29] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned unsat
[2020-05-12 03:59:30] [INFO ] [Real]Absence check using 62 positive place invariants in 279 ms returned sat
[2020-05-12 03:59:30] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 150 ms returned sat
[2020-05-12 03:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:32] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2020-05-12 03:59:42] [INFO ] Deduced a trap composed of 11 places in 9888 ms
[2020-05-12 03:59:48] [INFO ] Deduced a trap composed of 11 places in 5912 ms
[2020-05-12 03:59:55] [INFO ] Deduced a trap composed of 14 places in 6756 ms
[2020-05-12 03:59:55] [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 s8 s9 s217 s327 s328 s329) 0)") while checking expression at index 9
[2020-05-12 03:59:55] [INFO ] [Real]Absence check using 62 positive place invariants in 268 ms returned sat
[2020-05-12 03:59:55] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 66 ms returned sat
[2020-05-12 03:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:59] [INFO ] [Real]Absence check using state equation in 3685 ms returned sat
[2020-05-12 04:00:03] [INFO ] Deduced a trap composed of 8 places in 3787 ms
[2020-05-12 04:00:08] [INFO ] Deduced a trap composed of 16 places in 4865 ms
[2020-05-12 04:00:14] [INFO ] Deduced a trap composed of 15 places in 6523 ms
[2020-05-12 04:00:19] [INFO ] Deduced a trap composed of 19 places in 4816 ms
[2020-05-12 04:00:19] [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 s35 s36 s154 s155 s156 s251 s252 s253 s254 s290 s422 s423 s424 s426 s428 s429 s430) 0)") while checking expression at index 10
[2020-05-12 04:00:19] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-05-12 04:00:19] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2020-05-12 04:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:00:20] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2020-05-12 04:00:21] [INFO ] Deduced a trap composed of 8 places in 447 ms
[2020-05-12 04:00:21] [INFO ] Deduced a trap composed of 14 places in 387 ms
[2020-05-12 04:00:26] [INFO ] Deduced a trap composed of 14 places in 4433 ms
[2020-05-12 04:00:32] [INFO ] Deduced a trap composed of 11 places in 5950 ms
[2020-05-12 04:00:35] [INFO ] Deduced a trap composed of 8 places in 3456 ms
[2020-05-12 04:00:41] [INFO ] Deduced a trap composed of 17 places in 5502 ms
[2020-05-12 04:00:41] [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 s8 s9 s217 s220 s221 s222 s432 s433 s434) 0)") while checking expression at index 11
[2020-05-12 04:00:41] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2020-05-12 04:00:41] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 04:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:00:42] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2020-05-12 04:00:43] [INFO ] Deduced a trap composed of 8 places in 424 ms
[2020-05-12 04:00:43] [INFO ] Deduced a trap composed of 15 places in 384 ms
[2020-05-12 04:00:44] [INFO ] Deduced a trap composed of 28 places in 1483 ms
[2020-05-12 04:00:46] [INFO ] Deduced a trap composed of 17 places in 1943 ms
[2020-05-12 04:00:47] [INFO ] Deduced a trap composed of 20 places in 372 ms
[2020-05-12 04:00:48] [INFO ] Deduced a trap composed of 22 places in 1263 ms
[2020-05-12 04:00:49] [INFO ] Deduced a trap composed of 28 places in 600 ms
[2020-05-12 04:00:51] [INFO ] Deduced a trap composed of 18 places in 1832 ms
[2020-05-12 04:00:56] [INFO ] Deduced a trap composed of 11 places in 5112 ms
[2020-05-12 04:01:01] [INFO ] Deduced a trap composed of 23 places in 4678 ms
[2020-05-12 04:01:06] [INFO ] Deduced a trap composed of 36 places in 5342 ms
[2020-05-12 04:01:06] [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 s8 s9 s10 s11 s53 s54 s55 s63 s64 s67 s74 s75 s163 s303 s308 s323 s332 s333 s334 s338 s343 s353 s492 s493 s556 s557 s583 s584) 0)") while checking expression at index 12
[2020-05-12 04:01:06] [INFO ] [Real]Absence check using 62 positive place invariants in 167 ms returned sat
[2020-05-12 04:01:06] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 134 ms returned sat
[2020-05-12 04:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:09] [INFO ] [Real]Absence check using state equation in 2625 ms returned sat
[2020-05-12 04:01:15] [INFO ] Deduced a trap composed of 18 places in 6222 ms
[2020-05-12 04:01:19] [INFO ] Deduced a trap composed of 12 places in 4173 ms
[2020-05-12 04:01:26] [INFO ] Deduced a trap composed of 14 places in 6524 ms
[2020-05-12 04:01:26] [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 s247 s250 s347 s348 s349 s438 s443 s587 s588 s591 s592) 0)") while checking expression at index 13
[2020-05-12 04:01:26] [INFO ] [Real]Absence check using 62 positive place invariants in 348 ms returned sat
[2020-05-12 04:01:27] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 122 ms returned sat
[2020-05-12 04:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:29] [INFO ] [Real]Absence check using state equation in 2417 ms returned sat
[2020-05-12 04:01:32] [INFO ] Deduced a trap composed of 15 places in 2715 ms
[2020-05-12 04:01:37] [INFO ] Deduced a trap composed of 8 places in 4827 ms
[2020-05-12 04:01:38] [INFO ] Deduced a trap composed of 11 places in 1171 ms
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 14 places in 9973 ms
[2020-05-12 04:01:48] [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 s247 s250 s347 s348 s349 s438 s443 s587 s588 s591 s592) 0)") while checking expression at index 14
[2020-05-12 04:01:48] [INFO ] [Real]Absence check using 62 positive place invariants in 74 ms returned sat
[2020-05-12 04:01:48] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 41 ms returned sat
[2020-05-12 04:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:52] [INFO ] [Real]Absence check using state equation in 4221 ms returned sat
[2020-05-12 04:01:59] [INFO ] Deduced a trap composed of 8 places in 6527 ms
[2020-05-12 04:02:04] [INFO ] Deduced a trap composed of 15 places in 4872 ms
[2020-05-12 04:02:06] [INFO ] Deduced a trap composed of 12 places in 1904 ms
[2020-05-12 04:02:10] [INFO ] Deduced a trap composed of 19 places in 4279 ms
[2020-05-12 04:02:10] [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 s67 s68 s232 s233 s234 s238 s239 s240 s247 s250 s342 s343 s344 s348 s438 s443) 0)") while checking expression at index 15
[2020-05-12 04:02:10] [INFO ] [Real]Absence check using 62 positive place invariants in 241 ms returned sat
[2020-05-12 04:02:10] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 114 ms returned sat
[2020-05-12 04:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:14] [INFO ] [Real]Absence check using state equation in 3207 ms returned sat
[2020-05-12 04:02:14] [INFO ] Deduced a trap composed of 27 places in 378 ms
[2020-05-12 04:02:14] [INFO ] Deduced a trap composed of 12 places in 340 ms
[2020-05-12 04:02:15] [INFO ] Deduced a trap composed of 155 places in 336 ms
[2020-05-12 04:02:20] [INFO ] Deduced a trap composed of 125 places in 5464 ms
[2020-05-12 04:02:25] [INFO ] Deduced a trap composed of 16 places in 4328 ms
[2020-05-12 04:02:29] [INFO ] Deduced a trap composed of 20 places in 4564 ms
[2020-05-12 04:02:33] [INFO ] Deduced a trap composed of 34 places in 4069 ms
[2020-05-12 04:02:33] [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 s53 s54 s55 s67 s68 s235 s323 s332 s333 s334 s338 s343 s348 s352 s353 s354 s438 s492 s493 s556 s557 s583 s584 s587 s588 s591 s592) 0)") while checking expression at index 16
[2020-05-12 04:02:34] [INFO ] [Real]Absence check using 62 positive place invariants in 153 ms returned sat
[2020-05-12 04:02:34] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 107 ms returned sat
[2020-05-12 04:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:37] [INFO ] [Real]Absence check using state equation in 3409 ms returned sat
[2020-05-12 04:02:38] [INFO ] Deduced a trap composed of 8 places in 511 ms
[2020-05-12 04:02:38] [INFO ] Deduced a trap composed of 13 places in 394 ms
[2020-05-12 04:02:39] [INFO ] Deduced a trap composed of 28 places in 410 ms
[2020-05-12 04:02:39] [INFO ] Deduced a trap composed of 24 places in 394 ms
[2020-05-12 04:02:39] [INFO ] Deduced a trap composed of 156 places in 381 ms
[2020-05-12 04:02:40] [INFO ] Deduced a trap composed of 18 places in 391 ms
[2020-05-12 04:02:40] [INFO ] Deduced a trap composed of 15 places in 387 ms
[2020-05-12 04:02:49] [INFO ] Deduced a trap composed of 11 places in 8317 ms
[2020-05-12 04:02:54] [INFO ] Deduced a trap composed of 16 places in 5166 ms
[2020-05-12 04:02:54] [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 s8 s9 s217 s432 s433 s434 s579 s580) 0)") while checking expression at index 17
[2020-05-12 04:02:54] [INFO ] [Real]Absence check using 62 positive place invariants in 61 ms returned sat
[2020-05-12 04:02:54] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 41 ms returned sat
[2020-05-12 04:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:57] [INFO ] [Real]Absence check using state equation in 3026 ms returned sat
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 8 places in 405 ms
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 14 places in 366 ms
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 11 places in 201 ms
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 22 places in 171 ms
[2020-05-12 04:02:59] [INFO ] Deduced a trap composed of 14 places in 195 ms
[2020-05-12 04:02:59] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-05-12 04:02:59] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-05-12 04:02:59] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2020-05-12 04:02:59] [INFO ] Deduced a trap composed of 31 places in 186 ms
[2020-05-12 04:03:04] [INFO ] Deduced a trap composed of 23 places in 4184 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 26 places in 3249 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 39 places in 178 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 22 places in 77 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 27 places in 130 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 40 places in 73 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 41 places in 72 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 39 places in 70 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 44 places in 89 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 61 places in 104 ms
[2020-05-12 04:03:09] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 11411 ms
[2020-05-12 04:03:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:03:09] [INFO ] [Nat]Absence check using 62 positive place invariants in 143 ms returned sat
[2020-05-12 04:03:09] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 39 ms returned sat
[2020-05-12 04:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:10] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 13 places in 213 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 17 places in 185 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 14 places in 180 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 12 places in 179 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 32 places in 55 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 22 places in 26 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 24 places in 24 ms
[2020-05-12 04:03:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2292 ms
[2020-05-12 04:03:12] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 33 ms.
[2020-05-12 04:03:17] [INFO ] Added : 421 causal constraints over 85 iterations in 4983 ms. Result :sat
[2020-05-12 04:03:22] [INFO ] Deduced a trap composed of 160 places in 5444 ms
[2020-05-12 04:03:24] [INFO ] Deduced a trap composed of 167 places in 1693 ms
[2020-05-12 04:03:25] [INFO ] Deduced a trap composed of 156 places in 359 ms
[2020-05-12 04:03:25] [INFO ] Deduced a trap composed of 173 places in 360 ms
[2020-05-12 04:03:25] [INFO ] Deduced a trap composed of 157 places in 361 ms
[2020-05-12 04:03:26] [INFO ] Deduced a trap composed of 143 places in 163 ms
[2020-05-12 04:03:26] [INFO ] Deduced a trap composed of 149 places in 322 ms
[2020-05-12 04:03:26] [INFO ] Deduced a trap composed of 146 places in 333 ms
[2020-05-12 04:03:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9723 ms
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-05-12 04:03:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 04:03:27] [INFO ] Flatten gal took : 71 ms
[2020-05-12 04:03:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 04:03:27] [INFO ] Flatten gal took : 28 ms
FORMULA BusinessProcesses-PT-16-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 04:03:27] [INFO ] Applying decomposition
[2020-05-12 04:03:27] [INFO ] Flatten gal took : 23 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/graph15250061589481911773.txt, -o, /tmp/graph15250061589481911773.bin, -w, /tmp/graph15250061589481911773.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/graph15250061589481911773.bin, -l, -1, -v, -w, /tmp/graph15250061589481911773.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 04:03:27] [INFO ] Decomposing Gal with order
[2020-05-12 04:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:03:27] [INFO ] Removed a total of 285 redundant transitions.
[2020-05-12 04:03:28] [INFO ] Flatten gal took : 329 ms
[2020-05-12 04:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 13 ms.
[2020-05-12 04:03:28] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 24 ms
[2020-05-12 04:03:28] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 0 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 12 CTL formulae.
built 67 ordering constraints for composite.
built 21 ordering constraints for composite.
built 20 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 27 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 30 ordering constraints for composite.
built 14 ordering constraints for composite.
built 81 ordering constraints for composite.
built 15 ordering constraints for composite.
built 28 ordering constraints for composite.
built 24 ordering constraints for composite.
built 17 ordering constraints for composite.
built 89 ordering constraints for composite.
built 15 ordering constraints for composite.
built 19 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 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 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,3.74273e+27,25.6655,565544,35845,61,997436,913,1254,2.59338e+06,74,2446,0


Converting to forward existential form...Done !
original formula: EX(!(AG((i11.i0.i3.u127.p329!=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((i11.i0.i3.u127.p329!=1)))] != FALSE
(forward)formula 0,1,42.6474,585200,1,0,1.01855e+06,913,3487,2.80888e+06,138,2446,2704944
FORMULA BusinessProcesses-PT-16-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((i16.u137.p354==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i16.u137.p354==1))] != FALSE
(forward)formula 1,1,42.6872,586256,1,0,1.01888e+06,913,3489,2.81966e+06,138,2446,2713170
FORMULA BusinessProcesses-PT-16-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((i19.u204.p517==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i19.u204.p517==1))] != FALSE
(forward)formula 2,1,42.769,589688,1,0,1.01896e+06,913,3491,2.82234e+06,138,2446,2736874
FORMULA BusinessProcesses-PT-16-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(((i0.u91.p237!=1)||((i16.u145.p378==1)&&(i1.u239.p596==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i0.u91.p237!=1)||((i16.u145.p378==1)&&(i1.u239.p596==1)))))] = FALSE
(forward)formula 3,0,43.4252,606056,1,0,1.06111e+06,913,3503,2.93479e+06,140,2446,2770259
FORMULA BusinessProcesses-PT-16-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AF(((((i8.u5.p12==1)||(i11.i1.i1.u130.p339==1))||(i10.i0.i4.u159.p409==1))||(i3.u48.p118!=1))) * AG(((i6.u35.p83==1)||(i18.u256.p637!=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((i8.u5.p12==1)||(i11.i1.i1.u130.p339==1))||(i10.i0.i4.u159.p409==1))||(i3.u48.p118!=1))))] = FALSE * [(FwdU(Init,TRUE) * !(((i6.u35.p83==1)||(i18.u256.p637!=1))))] = FALSE)
(forward)formula 4,0,43.4798,608960,1,0,1.06839e+06,913,3510,2.94786e+06,141,2446,2776139
FORMULA BusinessProcesses-PT-16-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((i3.u8.p18==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i3.u8.p18==1))] != FALSE
(forward)formula 5,1,43.4803,609224,1,0,1.06839e+06,913,3511,2.94787e+06,141,2446,2776240
FORMULA BusinessProcesses-PT-16-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EX((((((((i17.u55.p136==1)&&(i17.u150.p392==1))&&(i17.u217.p544==1))&&(i19.u198.p505==1))&&(i8.u65.p167==1))&&(i11.i1.i0.u23.p56==1))||((i18.u252.p571!=1)&&(i6.u197.p503!=1)))) * (EX(((i12.u114.p298==1)&&(i17.u55.p137!=1))) + (EX((i10.i0.i0.u102.p268!=1)) * (EF((i19.u186.p480==1)) + AX((i19.u193.p494==1))))))
=> equivalent forward existential formula: ([(Init * !(EX((((((((i17.u55.p136==1)&&(i17.u150.p392==1))&&(i17.u217.p544==1))&&(i19.u198.p505==1))&&(i8.u65.p167==1))&&(i11.i1.i0.u23.p56==1))||((i18.u252.p571!=1)&&(i6.u197.p503!=1))))))] = FALSE * ([((Init * !(EX(((i12.u114.p298==1)&&(i17.u55.p137!=1))))) * !(EX((i10.i0.i0.u102.p268!=1))))] = FALSE * [(EY(((Init * !(EX(((i12.u114.p298==1)&&(i17.u55.p137!=1))))) * !(E(TRUE U (i19.u186.p480==1))))) * !((i19.u193.p494==1)))] = FALSE))
Reverse transition relation is NOT exact ! Due to transitions t29, t294, t416, t430, i0.t154, i0.u91.t297, i0.u94.t287, i0.u174.t155, i1.t298, i1.t158, i1.u87.t305, i1.u89.t301, i1.u173.t159, i2.u56.t355, i2.u58.t351, i3.u46.t373, i3.u48.t369, i4.t444, i4.t442, i4.t424, i4.t115, i4.u14.t440, i4.u20.t425, i4.u20.t429, i4.u21.t427, i4.u15.t438, i4.u190.t119, i5.t435, i5.t433, i5.u16.t437, i6.t415, i6.t410, i6.t102, i6.u27.t413, i6.u35.t397, i6.u28.t411, i6.u197.t106, i7.t391, i7.t385, i7.t383, i7.t381, i7.t378, i7.t376, i7.u40.t387, i8.u60.t347, i8.u64.t339, i9.t403, i9.t170, i9.t166, i9.t162, i9.u33.t401, i9.u167.t171, i9.u169.t167, i9.u171.t163, i10.i0.i1.t206, i10.i0.i1.u148.t207, i10.i0.i2.t198, i10.i0.i2.u152.t199, i10.i0.i3.t190, i10.i0.i3.u156.t191, i10.i0.i4.t186, i10.i0.i4.u158.t187, i10.i1.i0.u50.t365, i10.i1.i1.t194, i10.i1.i1.u155.t195, i11.i0.i2.t258, i11.i0.i2.u122.t259, i11.i0.i3.t250, i11.i0.i3.u126.t251, i11.i0.i4.t238, i11.i0.i4.u133.t239, i11.i1.i0.t421, i11.i1.i0.t419, i11.i1.i0.u22.t423, i11.i1.i1.t242, i11.i1.i1.u131.t243, i12.t281, i12.t278, i12.t274, i12.t132, i12.t128, i12.u112.t282, i12.u115.t279, i12.u117.t275, i12.u182.t134, i13.t407, i13.t262, i13.u29.t409, i13.u120.t263, i14.t254, i14.t222, i14.u62.t343, i14.u124.t255, i14.u140.t223, i15.t246, i15.u85.t309, i15.u129.t247, i16.t234, i16.t230, i16.t226, i16.t218, i16.t214, i16.t210, i16.u134.t235, i16.u136.t231, i16.u138.t227, i16.u143.t219, i16.u144.t215, i16.u147.t211, i17.t202, i17.u54.t359, i17.u150.t203, i18.t317, i18.t315, i18.t313, i18.t182, i18.t178, i18.t174, i18.u67.t321, i18.u67.t325, i18.u67.t329, i18.u67.t335, i18.u161.t183, i18.u162.t179, i18.u165.t175, i19.t148, i19.t141, i19.t136, i19.t130, i19.t126, i19.t124, i19.t122, i19.t117, i19.t113, i19.t111, i19.t109, i19.t104, i19.t100, i19.t98, i19.t95, i19.t93, i19.t90, i19.t88, i19.t86, i19.t84, i19.t82, i19.t80, i19.t77, i19.t69, i19.t66, i19.t63, i19.t60, i19.t57, i19.t54, i19.t26, i19.t23, i19.t20, i19.t17, i19.t14, i19.u176.t12, i19.u176.t37, i19.u176.t41, i19.u176.t45, i19.u176.t51, i19.u176.t74, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/367/165/568
(forward)formula 6,1,261.609,3526084,1,0,5.67288e+06,960,4146,1.59044e+07,189,3651,2677963
FORMULA BusinessProcesses-PT-16-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(AG((i6.u35.p83==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i6.u35.p83==1)))))] != FALSE
(forward)formula 7,0,263.303,3526084,1,0,5.67288e+06,960,4149,1.59044e+07,189,3651,3313689
FORMULA BusinessProcesses-PT-16-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(EF((((i8.u60.p151==1)&&(i12.u115.p296==1))&&(i19.u176.p603==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i8.u60.p151==1)&&(i12.u115.p296==1))&&(i19.u176.p603==1)))] = FALSE
(forward)formula 8,0,263.432,3526084,1,0,5.67288e+06,960,4160,1.59044e+07,190,3651,3347784
FORMULA BusinessProcesses-PT-16-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(((i6.u28.p68==1)&&(i7.u45.p93==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i6.u28.p68==1)&&(i7.u45.p93==1)))] != FALSE
(forward)formula 9,1,263.46,3526084,1,0,5.67288e+06,960,4165,1.59044e+07,190,3651,3349063
FORMULA BusinessProcesses-PT-16-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(((AF((i0.u1.p2!=1)) + EF((i11.i0.i0.u109.p283==1))) + (i18.u246.p613==1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((i18.u246.p613==1))) * !(E(TRUE U (i11.i0.i0.u109.p283==1)))),!((i0.u1.p2!=1)))] = FALSE
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
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
Using saturation style SCC detection
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 an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found a local 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
(forward)formula 10,0,286.82,3526084,1,0,5.67288e+06,960,8014,1.8573e+07,327,3651,3791630
FORMULA BusinessProcesses-PT-16-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-12 04:25:28] [INFO ] Applying decomposition
[2020-05-12 04:25:28] [INFO ] Flatten gal took : 37 ms
[2020-05-12 04:25:28] [INFO ] Decomposing Gal with order
[2020-05-12 04:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:25:28] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 04:25:28] [INFO ] Flatten gal took : 63 ms
[2020-05-12 04:25:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-12 04:25:28] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 29 ms
[2020-05-12 04:25:28] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 0 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 1 CTL formulae.
built 2 ordering constraints for composite.
built 147 ordering constraints for composite.
built 83 ordering constraints for composite.
built 82 ordering constraints for composite.
built 81 ordering constraints for composite.
built 81 ordering constraints for composite.
built 81 ordering constraints for composite.
built 79 ordering constraints for composite.
built 77 ordering constraints for composite.
built 75 ordering constraints for composite.
built 73 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 29 ordering constraints for composite.
built 26 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 66 ordering constraints for composite.
built 64 ordering constraints for composite.
built 62 ordering constraints for composite.
built 60 ordering constraints for composite.
built 58 ordering constraints for composite.
built 56 ordering constraints for composite.
built 54 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 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 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 87 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:47:32] [INFO ] Flatten gal took : 2444 ms
[2020-05-12 04:47:33] [INFO ] Input system was already deterministic with 570 transitions.
[2020-05-12 04:47:33] [INFO ] Transformed 630 places.
[2020-05-12 04:47:33] [INFO ] Transformed 570 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 04:48:03] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-12 04:48:03] [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, --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 1 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;