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-158897699100459.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 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 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 59K 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-02-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589250031040

[2020-05-12 02:20:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:20:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:20:38] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2020-05-12 02:20:38] [INFO ] Transformed 262 places.
[2020-05-12 02:20:38] [INFO ] Transformed 219 transitions.
[2020-05-12 02:20:38] [INFO ] Found NUPN structural information;
[2020-05-12 02:20:38] [INFO ] Parsed PT model containing 262 places and 219 transitions in 301 ms.
Deduced a syphon composed of 17 places in 15 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 157 ms.
Incomplete random walk after 100000 steps, including 1356 resets, run finished after 526 ms. (steps per millisecond=190 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:20:39] [INFO ] Computed 43 place invariants in 65 ms
[2020-05-12 02:20:40] [INFO ] [Real]Absence check using 30 positive place invariants in 108 ms returned sat
[2020-05-12 02:20:40] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 16 ms returned sat
[2020-05-12 02:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:41] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2020-05-12 02:20:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:20:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 199 ms returned sat
[2020-05-12 02:20:41] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 50 ms returned sat
[2020-05-12 02:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:20:42] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2020-05-12 02:20:43] [INFO ] Deduced a trap composed of 8 places in 1567 ms
[2020-05-12 02:20:45] [INFO ] Deduced a trap composed of 11 places in 1517 ms
[2020-05-12 02:20:47] [INFO ] Deduced a trap composed of 17 places in 1550 ms
[2020-05-12 02:20:49] [INFO ] Deduced a trap composed of 29 places in 1992 ms
[2020-05-12 02:20:49] [INFO ] Deduced a trap composed of 24 places in 529 ms
[2020-05-12 02:20:50] [INFO ] Deduced a trap composed of 21 places in 1328 ms
[2020-05-12 02:20:52] [INFO ] Deduced a trap composed of 25 places in 1479 ms
[2020-05-12 02:20:54] [INFO ] Deduced a trap composed of 20 places in 1700 ms
[2020-05-12 02:20:55] [INFO ] Deduced a trap composed of 18 places in 1569 ms
[2020-05-12 02:20:57] [INFO ] Deduced a trap composed of 30 places in 1458 ms
[2020-05-12 02:20:59] [INFO ] Deduced a trap composed of 42 places in 2094 ms
[2020-05-12 02:21:00] [INFO ] Deduced a trap composed of 38 places in 1067 ms
[2020-05-12 02:21:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 18204 ms
[2020-05-12 02:21:00] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 13 ms.
[2020-05-12 02:21:01] [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: Broken pipe (=> (> t152 0) (and (> t193 0) (< o193 o152)))") while checking expression at index 0
[2020-05-12 02:21:01] [INFO ] [Real]Absence check using 30 positive place invariants in 131 ms returned sat
[2020-05-12 02:21:01] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 68 ms returned sat
[2020-05-12 02:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:02] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2020-05-12 02:21:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 70 ms returned unsat
[2020-05-12 02:21:02] [INFO ] [Real]Absence check using 30 positive place invariants in 52 ms returned sat
[2020-05-12 02:21:02] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 39 ms returned sat
[2020-05-12 02:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:03] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2020-05-12 02:21:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 126 ms returned sat
[2020-05-12 02:21:03] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 31 ms returned sat
[2020-05-12 02:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:04] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 8 places in 1641 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 15 places in 1901 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 21 places in 2466 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 17 places in 2458 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 17 places in 1960 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 14 places in 1961 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 29 places in 2027 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 31 places in 937 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 38 places in 1901 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 41 places in 1608 ms
[2020-05-12 02:21:26] [INFO ] Deduced a trap composed of 62 places in 2897 ms
[2020-05-12 02:21: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 s36 s41 s42 s56 s57 s58 s62 s63 s64 s74 s75 s76 s80 s81 s82 s87 s90 s119 s132 s136 s137 s138 s142 s147 s162 s181 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s201 s202 s207 s208 s209 s210 s214 s215 s216 s217 s220 s221 s228 s229 s232 s233 s236 s237 s238 s239) 0)") while checking expression at index 2
[2020-05-12 02:21:26] [INFO ] [Real]Absence check using 30 positive place invariants in 67 ms returned sat
[2020-05-12 02:21:26] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 30 ms returned sat
[2020-05-12 02:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:26] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2020-05-12 02:21:28] [INFO ] Deduced a trap composed of 14 places in 1186 ms
[2020-05-12 02:21:29] [INFO ] Deduced a trap composed of 16 places in 1674 ms
[2020-05-12 02:21:31] [INFO ] Deduced a trap composed of 32 places in 1268 ms
[2020-05-12 02:21:32] [INFO ] Deduced a trap composed of 18 places in 1381 ms
[2020-05-12 02:21:32] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-05-12 02:21:33] [INFO ] Deduced a trap composed of 11 places in 457 ms
[2020-05-12 02:21:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6175 ms
[2020-05-12 02:21:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 119 ms returned sat
[2020-05-12 02:21:33] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 33 ms returned sat
[2020-05-12 02:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:34] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2020-05-12 02:21:35] [INFO ] Deduced a trap composed of 14 places in 1663 ms
[2020-05-12 02:21:37] [INFO ] Deduced a trap composed of 16 places in 1556 ms
[2020-05-12 02:21:38] [INFO ] Deduced a trap composed of 32 places in 1482 ms
[2020-05-12 02:21:39] [INFO ] Deduced a trap composed of 18 places in 868 ms
[2020-05-12 02:21:40] [INFO ] Deduced a trap composed of 12 places in 674 ms
[2020-05-12 02:21:41] [INFO ] Deduced a trap composed of 11 places in 734 ms
[2020-05-12 02:21:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7085 ms
[2020-05-12 02:21:41] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 40 ms.
[2020-05-12 02:21:42] [INFO ] Added : 165 causal constraints over 33 iterations in 1214 ms. Result :sat
[2020-05-12 02:21:44] [INFO ] Deduced a trap composed of 59 places in 1822 ms
[2020-05-12 02:21:45] [INFO ] Deduced a trap composed of 59 places in 1603 ms
[2020-05-12 02:21:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3502 ms
[2020-05-12 02:21:46] [INFO ] [Real]Absence check using 30 positive place invariants in 78 ms returned sat
[2020-05-12 02:21:46] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2020-05-12 02:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:46] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2020-05-12 02:21:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 111 ms returned sat
[2020-05-12 02:21:47] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 26 ms returned sat
[2020-05-12 02:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:47] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2020-05-12 02:21:50] [INFO ] Deduced a trap composed of 8 places in 2551 ms
[2020-05-12 02:21:52] [INFO ] Deduced a trap composed of 11 places in 2338 ms
[2020-05-12 02:21:54] [INFO ] Deduced a trap composed of 15 places in 1864 ms
[2020-05-12 02:21:56] [INFO ] Deduced a trap composed of 19 places in 2267 ms
[2020-05-12 02:21:59] [INFO ] Deduced a trap composed of 19 places in 2329 ms
[2020-05-12 02:22:00] [INFO ] Deduced a trap composed of 27 places in 1582 ms
[2020-05-12 02:22:03] [INFO ] Deduced a trap composed of 23 places in 2418 ms
[2020-05-12 02:22:05] [INFO ] Deduced a trap composed of 11 places in 2366 ms
[2020-05-12 02:22:06] [INFO ] Deduced a trap composed of 18 places in 1016 ms
[2020-05-12 02:22:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 18924 ms
[2020-05-12 02:22:06] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 43 ms.
[2020-05-12 02:22:06] [INFO ] Added : 10 causal constraints over 2 iterations in 156 ms. Result :unknown
[2020-05-12 02:22:07] [INFO ] [Real]Absence check using 30 positive place invariants in 52 ms returned sat
[2020-05-12 02:22:07] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 17 ms returned sat
[2020-05-12 02:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:07] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-05-12 02:22:09] [INFO ] Deduced a trap composed of 14 places in 1477 ms
[2020-05-12 02:22:11] [INFO ] Deduced a trap composed of 21 places in 1904 ms
[2020-05-12 02:22:13] [INFO ] Deduced a trap composed of 37 places in 2112 ms
[2020-05-12 02:22:15] [INFO ] Deduced a trap composed of 20 places in 2143 ms
[2020-05-12 02:22:17] [INFO ] Deduced a trap composed of 8 places in 2099 ms
[2020-05-12 02:22:20] [INFO ] Deduced a trap composed of 20 places in 2291 ms
[2020-05-12 02:22:22] [INFO ] Deduced a trap composed of 34 places in 2073 ms
[2020-05-12 02:22:23] [INFO ] Deduced a trap composed of 41 places in 1790 ms
[2020-05-12 02:22:26] [INFO ] Deduced a trap composed of 11 places in 2195 ms
[2020-05-12 02:22:27] [INFO ] Deduced a trap composed of 41 places in 1011 ms
[2020-05-12 02:22:27] [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 s16 s17 s18 s24 s25 s36 s41 s42 s43 s45 s46 s50 s113 s114 s115 s119 s127 s132 s136 s137 s138 s142 s147 s157 s167 s207 s208 s230 s231 s234 s235) 0)") while checking expression at index 5
[2020-05-12 02:22:27] [INFO ] [Real]Absence check using 30 positive place invariants in 97 ms returned sat
[2020-05-12 02:22:27] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2020-05-12 02:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:28] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 20 places in 1372 ms
[2020-05-12 02:22:32] [INFO ] Deduced a trap composed of 55 places in 2750 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 24 places in 2416 ms
[2020-05-12 02:22:36] [INFO ] Deduced a trap composed of 8 places in 1943 ms
[2020-05-12 02:22:38] [INFO ] Deduced a trap composed of 15 places in 2039 ms
[2020-05-12 02:22:40] [INFO ] Deduced a trap composed of 21 places in 1998 ms
[2020-05-12 02:22:42] [INFO ] Deduced a trap composed of 52 places in 2088 ms
[2020-05-12 02:22:44] [INFO ] Deduced a trap composed of 8 places in 1928 ms
[2020-05-12 02:22:46] [INFO ] Deduced a trap composed of 19 places in 1813 ms
[2020-05-12 02:22:48] [INFO ] Deduced a trap composed of 12 places in 1659 ms
[2020-05-12 02:22: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 s56 s57 s58 s87 s90 s171 s172 s173 s177) 0)") while checking expression at index 6
[2020-05-12 02:22:48] [INFO ] [Real]Absence check using 30 positive place invariants in 75 ms returned sat
[2020-05-12 02:22:48] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 17 ms returned sat
[2020-05-12 02:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:49] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-05-12 02:22:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:22:49] [INFO ] [Nat]Absence check using 30 positive place invariants in 107 ms returned sat
[2020-05-12 02:22:49] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 14 ms returned sat
[2020-05-12 02:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:50] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2020-05-12 02:22:51] [INFO ] Deduced a trap composed of 15 places in 1666 ms
[2020-05-12 02:22:53] [INFO ] Deduced a trap composed of 17 places in 1861 ms
[2020-05-12 02:22:55] [INFO ] Deduced a trap composed of 20 places in 1966 ms
[2020-05-12 02:22:57] [INFO ] Deduced a trap composed of 14 places in 2286 ms
[2020-05-12 02:23:00] [INFO ] Deduced a trap composed of 8 places in 2817 ms
[2020-05-12 02:23:03] [INFO ] Deduced a trap composed of 18 places in 2674 ms
[2020-05-12 02:23:05] [INFO ] Deduced a trap composed of 57 places in 1921 ms
[2020-05-12 02:23:07] [INFO ] Deduced a trap composed of 28 places in 2466 ms
[2020-05-12 02:23:09] [INFO ] Deduced a trap composed of 38 places in 2035 ms
[2020-05-12 02:23:09] [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 s24 s25 s36 s38 s39 s43 s45 s46 s47 s118 s119 s120 s123 s127 s132 s137 s142 s147 s152 s162 s207 s208 s222 s223 s226 s227 s230 s231) 0)") while checking expression at index 7
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 02:23:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:23:10] [INFO ] Flatten gal took : 164 ms
[2020-05-12 02:23:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:23:10] [INFO ] Flatten gal took : 47 ms
FORMULA BusinessProcesses-PT-02-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:23:10] [INFO ] Applying decomposition
[2020-05-12 02:23:10] [INFO ] Flatten gal took : 46 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/graph1844212355212826514.txt, -o, /tmp/graph1844212355212826514.bin, -w, /tmp/graph1844212355212826514.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/graph1844212355212826514.bin, -l, -1, -v, -w, /tmp/graph1844212355212826514.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:23:10] [INFO ] Decomposing Gal with order
[2020-05-12 02:23:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:23:11] [INFO ] Removed a total of 36 redundant transitions.
[2020-05-12 02:23:11] [INFO ] Flatten gal took : 527 ms
[2020-05-12 02:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-12 02:23:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 28 ms
[2020-05-12 02:23:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 42 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 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 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 36 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 15 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.
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.14315e+12,0.786994,15308,2315,27,22728,248,578,27919,49,494,0


Converting to forward existential form...Done !
original formula: EF(((i6.i1.u32.p95!=0)&&(i16.u70.p230!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i6.i1.u32.p95!=0)&&(i16.u70.p230!=1)))] != FALSE
(forward)formula 0,1,0.807515,15744,1,0,22728,248,588,27919,54,494,2103
FORMULA BusinessProcesses-PT-02-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((i11.i1.u51.p150==0)||(i4.i0.u11.p28==1)) + AX(((i3.i0.u6.p17==0)||(i0.u28.p86==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(((i11.i1.u51.p150==0)||(i4.i0.u11.p28==1))))) * !(((i3.i0.u6.p17==0)||(i0.u28.p86==1))))] = FALSE
(forward)formula 1,0,0.853998,15744,1,0,22728,248,807,27919,71,494,24803
FORMULA BusinessProcesses-PT-02-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG((i5.u85.p231==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i5.u85.p231==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
Fast SCC detection found an SCC at level 6
Fast SCC detection found an 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 a local 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
(forward)formula 2,0,1.17842,25512,1,0,47075,248,2312,64402,186,494,109170
FORMULA BusinessProcesses-PT-02-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i3.i0.u7.p18!=1)&&(i5.u97.p258!=0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i3.i0.u7.p18!=1)&&(i5.u97.p258!=0)))] != FALSE
(forward)formula 3,1,1.20099,25776,1,0,47095,248,2321,64439,188,494,109343
FORMULA BusinessProcesses-PT-02-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t150, t156, t168, t174, i0.u25.t141, i0.u27.t135, i1.u21.t153, i1.u23.t149, i2.i0.t162, i2.i0.u14.t167, i3.i0.u6.t182, i3.i1.t114, i3.i1.u44.t115, i4.i0.t171, i4.i0.u11.t173, i4.i1.t90, i4.i1.u55.t91, i5.u17.t161, i6.i1.u31.t127, i7.i1.t66, i7.i1.u66.t67, i7.i2.t62, i7.i2.u69.t63, i8.i1.t94, i8.i1.u53.t95, i8.i2.t82, i8.i2.u58.t83, i10.t110, i10.u46.t111, i11.i0.t177, i11.i0.u8.t179, i11.i1.t98, i11.i1.u50.t99, i12.t86, i12.u57.t87, i13.t78, i13.u61.t79, i14.t74, i14.u62.t75, i15.i0.u29.t131, i15.i1.t70, i15.i1.u64.t71, i16.t56, i16.t45, i16.t43, i16.t40, i16.t38, i16.t35, i16.t33, i16.t30, i16.t28, i16.t21, i16.t18, i16.t15, i16.t12, i16.t9, i16.t6, i16.u70.t4, i16.u70.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/145/59/204
(forward)formula 4,1,2.00089,62736,1,0,131520,248,3417,155207,243,494,433905
FORMULA BusinessProcesses-PT-02-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(AF(((i7.i2.u34.p98==0)||(i6.i0.u33.p97==1)))) * EX((i12.u56.p161!=1)))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((i7.i2.u34.p98==0)||(i6.i0.u33.p97==1))))] = FALSE * [(Init * !(EX((i12.u56.p161!=1))))] = FALSE)
(forward)formula 5,0,2.50822,86760,1,0,186565,248,3520,204193,247,572,560000
FORMULA BusinessProcesses-PT-02-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(EF(((i11.i0.u8.p23==1)&&((i3.i1.u45.p130==0)||(i15.i1.u64.p182==1))))) * E(((i0.u26.p78==0)||(i15.i1.u65.p181==1)) U ((i1.u23.p63==0)||(i0.u91.p244==1)))) * AX(((((i0.u25.p69==0)||(i4.i0.u12.p31==1))||(i7.i1.u22.p62==0))||(i16.u77.p214==1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((i11.i0.u8.p23==1)&&((i3.i1.u45.p130==0)||(i15.i1.u64.p182==1))))] = FALSE * [(Init * !(E(((i0.u26.p78==0)||(i15.i1.u65.p181==1)) U ((i1.u23.p63==0)||(i0.u91.p244==1)))))] = FALSE) * [(EY(Init) * !(((((i0.u25.p69==0)||(i4.i0.u12.p31==1))||(i7.i1.u22.p62==0))||(i16.u77.p214==1))))] = FALSE)
(forward)formula 6,0,3.36247,115008,1,0,233666,287,4043,290125,267,714,660091
FORMULA BusinessProcesses-PT-02-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i16.u90.p241==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i16.u90.p241==1))] != FALSE
(forward)formula 7,1,3.38393,115008,1,0,233672,287,4045,290175,267,714,660438
FORMULA BusinessProcesses-PT-02-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AG(((i9.u42.p120==0)||(i11.i0.u9.p24==1))) U (((i3.i0.u6.p16==1)&&((i9.u43.p124==0)||(i12.u56.p165==1)))&&((i16.u88.p238==0)||(i16.u88.p238==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((i9.u42.p120==0)||(i11.i0.u9.p24==1)))))) * (((i3.i0.u6.p16==1)&&((i9.u43.p124==0)||(i12.u56.p165==1)))&&((i16.u88.p238==0)||(i16.u88.p238==1))))] != FALSE
(forward)formula 8,0,3.52092,118968,1,0,241419,287,4176,301987,268,714,684278
FORMULA BusinessProcesses-PT-02-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((EF(((i3.i0.u7.p18==0)||(i0.u28.p85==1))) * (i1.u21.p58!=0)) * (i16.u78.p216!=1)))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (i16.u78.p216!=1)) * (i1.u21.p58!=0)),TRUE) * ((i3.i0.u7.p18==0)||(i0.u28.p85==1)))] != FALSE
(forward)formula 9,1,3.69175,124248,1,0,251398,296,4199,314886,268,765,724577
FORMULA BusinessProcesses-PT-02-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589250196093

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-02"
export BK_EXAMINATION="CTLCardinality"
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-02, examination is CTLCardinality"
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-158897699100459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;