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.r182-oct2-158987914000523.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 itslola
Input is BusinessProcesses-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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.6K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 131K 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-10-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591160952553

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:09:14] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:09:14] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-03 05:09:14] [INFO ] Transformed 518 places.
[2020-06-03 05:09:14] [INFO ] Transformed 471 transitions.
[2020-06-03 05:09:14] [INFO ] Found NUPN structural information;
[2020-06-03 05:09:14] [INFO ] Parsed PT model containing 518 places and 471 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 47 ms.
Incomplete random walk after 100000 steps, including 826 resets, run finished after 235 ms. (steps per millisecond=425 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 471 rows 518 cols
[2020-06-03 05:09:14] [INFO ] Computed 85 place invariants in 21 ms
[2020-06-03 05:09:14] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2020-06-03 05:09:14] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-06-03 05:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:15] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2020-06-03 05:09:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:09:15] [INFO ] [Nat]Absence check using 48 positive place invariants in 45 ms returned sat
[2020-06-03 05:09:15] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-06-03 05:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:16] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2020-06-03 05:09:17] [INFO ] Deduced a trap composed of 15 places in 512 ms
[2020-06-03 05:09:17] [INFO ] Deduced a trap composed of 13 places in 275 ms
[2020-06-03 05:09:17] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-06-03 05:09:17] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 05:09:17] [INFO ] Deduced a trap composed of 140 places in 154 ms
[2020-06-03 05:09:18] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-06-03 05:09:18] [INFO ] Deduced a trap composed of 24 places in 171 ms
[2020-06-03 05:09:18] [INFO ] Deduced a trap composed of 28 places in 164 ms
[2020-06-03 05:09:18] [INFO ] Deduced a trap composed of 31 places in 162 ms
[2020-06-03 05:09:18] [INFO ] Deduced a trap composed of 30 places in 187 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 15 places in 182 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 130 places in 175 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 17 places in 136 ms
[2020-06-03 05:09:19] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-06-03 05:09:20] [INFO ] Deduced a trap composed of 51 places in 104 ms
[2020-06-03 05:09:20] [INFO ] Deduced a trap composed of 57 places in 79 ms
[2020-06-03 05:09:20] [INFO ] Deduced a trap composed of 49 places in 76 ms
[2020-06-03 05:09:20] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-06-03 05:09:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3872 ms
[2020-06-03 05:09:20] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 21 ms.
[2020-06-03 05:09:24] [INFO ] Added : 376 causal constraints over 76 iterations in 3633 ms. Result :sat
[2020-06-03 05:09:24] [INFO ] Deduced a trap composed of 119 places in 138 ms
[2020-06-03 05:09:24] [INFO ] Deduced a trap composed of 119 places in 106 ms
[2020-06-03 05:09:24] [INFO ] Deduced a trap composed of 113 places in 112 ms
[2020-06-03 05:09:24] [INFO ] Deduced a trap composed of 108 places in 101 ms
[2020-06-03 05:09:24] [INFO ] Deduced a trap composed of 131 places in 110 ms
[2020-06-03 05:09:25] [INFO ] Deduced a trap composed of 122 places in 94 ms
[2020-06-03 05:09:25] [INFO ] Deduced a trap composed of 123 places in 109 ms
[2020-06-03 05:09:25] [INFO ] Deduced a trap composed of 127 places in 108 ms
[2020-06-03 05:09:25] [INFO ] Deduced a trap composed of 114 places in 110 ms
[2020-06-03 05:09:25] [INFO ] Deduced a trap composed of 119 places in 107 ms
[2020-06-03 05:09:26] [INFO ] Deduced a trap composed of 125 places in 106 ms
[2020-06-03 05:09:26] [INFO ] Deduced a trap composed of 133 places in 106 ms
[2020-06-03 05:09:26] [INFO ] Deduced a trap composed of 116 places in 106 ms
[2020-06-03 05:09:26] [INFO ] Deduced a trap composed of 119 places in 340 ms
[2020-06-03 05:09:27] [INFO ] Deduced a trap composed of 117 places in 106 ms
[2020-06-03 05:09:27] [INFO ] Deduced a trap composed of 120 places in 113 ms
[2020-06-03 05:09:27] [INFO ] Deduced a trap composed of 134 places in 97 ms
[2020-06-03 05:09:27] [INFO ] Deduced a trap composed of 116 places in 115 ms
[2020-06-03 05:09:27] [INFO ] Deduced a trap composed of 127 places in 139 ms
[2020-06-03 05:09:28] [INFO ] Deduced a trap composed of 114 places in 135 ms
[2020-06-03 05:09:28] [INFO ] Deduced a trap composed of 122 places in 128 ms
[2020-06-03 05:09:28] [INFO ] Deduced a trap composed of 128 places in 93 ms
[2020-06-03 05:09:28] [INFO ] Deduced a trap composed of 117 places in 116 ms
[2020-06-03 05:09:28] [INFO ] Deduced a trap composed of 129 places in 98 ms
[2020-06-03 05:09:29] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5081 ms
[2020-06-03 05:09:29] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2020-06-03 05:09:29] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-06-03 05:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:29] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 18 places in 154 ms
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 123 places in 212 ms
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-06-03 05:09:30] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-06-03 05:09:31] [INFO ] Deduced a trap composed of 15 places in 144 ms
[2020-06-03 05:09:31] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2020-06-03 05:09:31] [INFO ] Deduced a trap composed of 54 places in 137 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 36 places in 789 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 41 places in 128 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 113 places in 148 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 41 places in 126 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 42 places in 118 ms
[2020-06-03 05:09:32] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-06-03 05:09:33] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-06-03 05:09:33] [INFO ] Deduced a trap composed of 28 places in 30 ms
[2020-06-03 05:09:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3263 ms
[2020-06-03 05:09:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:09:33] [INFO ] [Nat]Absence check using 48 positive place invariants in 49 ms returned sat
[2020-06-03 05:09:33] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-06-03 05:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:33] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2020-06-03 05:09:33] [INFO ] Deduced a trap composed of 10 places in 160 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 9 places in 174 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 17 places in 167 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 17 places in 143 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 131 places in 185 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 39 places in 147 ms
[2020-06-03 05:09:34] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 24 places in 157 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 44 places in 141 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-06-03 05:09:35] [INFO ] Deduced a trap composed of 127 places in 119 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 130 places in 147 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 25 places in 136 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 31 places in 116 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2020-06-03 05:09:36] [INFO ] Deduced a trap composed of 28 places in 19 ms
[2020-06-03 05:09:36] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3229 ms
[2020-06-03 05:09:36] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 22 ms.
[2020-06-03 05:09:40] [INFO ] Added : 371 causal constraints over 75 iterations in 3249 ms. Result :sat
[2020-06-03 05:09:40] [INFO ] [Real]Absence check using 48 positive place invariants in 26 ms returned sat
[2020-06-03 05:09:40] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-06-03 05:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:40] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 05:09:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:09:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 63 ms returned sat
[2020-06-03 05:09:41] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 33 ms returned sat
[2020-06-03 05:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:41] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 132 places in 159 ms
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 8 places in 166 ms
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-06-03 05:09:42] [INFO ] Deduced a trap composed of 26 places in 135 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 115 places in 156 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 31 places in 188 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 17 places in 151 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 125 places in 126 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 115 places in 122 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-06-03 05:09:43] [INFO ] Deduced a trap composed of 120 places in 142 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 34 places in 146 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 33 places in 142 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 15 places in 150 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 120 places in 148 ms
[2020-06-03 05:09:44] [INFO ] Deduced a trap composed of 111 places in 146 ms
[2020-06-03 05:09:45] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 05:09:45] [INFO ] Deduced a trap composed of 38 places in 129 ms
[2020-06-03 05:09:45] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-03 05:09:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3646 ms
[2020-06-03 05:09:45] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 25 ms.
[2020-06-03 05:09:47] [INFO ] Added : 319 causal constraints over 65 iterations in 2434 ms. Result :sat
[2020-06-03 05:09:48] [INFO ] Deduced a trap composed of 118 places in 157 ms
[2020-06-03 05:09:48] [INFO ] Deduced a trap composed of 126 places in 153 ms
[2020-06-03 05:09:48] [INFO ] Deduced a trap composed of 130 places in 120 ms
[2020-06-03 05:09:48] [INFO ] Deduced a trap composed of 126 places in 174 ms
[2020-06-03 05:09:48] [INFO ] Deduced a trap composed of 126 places in 136 ms
[2020-06-03 05:09:49] [INFO ] Deduced a trap composed of 134 places in 124 ms
[2020-06-03 05:09:49] [INFO ] Deduced a trap composed of 129 places in 123 ms
[2020-06-03 05:09:49] [INFO ] Deduced a trap composed of 118 places in 147 ms
[2020-06-03 05:09:49] [INFO ] Deduced a trap composed of 115 places in 110 ms
[2020-06-03 05:09:49] [INFO ] Deduced a trap composed of 118 places in 107 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 113 places in 141 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 118 places in 134 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 120 places in 132 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 112 places in 134 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 119 places in 126 ms
[2020-06-03 05:09:50] [INFO ] Deduced a trap composed of 117 places in 129 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 118 places in 115 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 115 places in 113 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 122 places in 109 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 115 places in 120 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 112 places in 111 ms
[2020-06-03 05:09:51] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 05:09:52] [INFO ] Deduced a trap composed of 127 places in 116 ms
[2020-06-03 05:09:52] [INFO ] Deduced a trap composed of 113 places in 131 ms
[2020-06-03 05:09:52] [INFO ] Deduced a trap composed of 113 places in 137 ms
[2020-06-03 05:09:52] [INFO ] Deduced a trap composed of 125 places in 184 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 123 places in 149 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 117 places in 110 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 113 places in 110 ms
[2020-06-03 05:09:53] [INFO ] Deduced a trap composed of 117 places in 141 ms
[2020-06-03 05:09:54] [INFO ] Deduced a trap composed of 118 places in 126 ms
[2020-06-03 05:09:54] [INFO ] Deduced a trap composed of 143 places in 127 ms
[2020-06-03 05:09:54] [INFO ] Deduced a trap composed of 121 places in 156 ms
[2020-06-03 05:09:54] [INFO ] Deduced a trap composed of 110 places in 103 ms
[2020-06-03 05:09:54] [INFO ] Deduced a trap composed of 123 places in 106 ms
[2020-06-03 05:09:55] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-06-03 05:09:55] [INFO ] Deduced a trap composed of 129 places in 100 ms
[2020-06-03 05:09:55] [INFO ] Deduced a trap composed of 126 places in 134 ms
[2020-06-03 05:09:55] [INFO ] Deduced a trap composed of 136 places in 106 ms
[2020-06-03 05:09:55] [INFO ] Deduced a trap composed of 117 places in 103 ms
[2020-06-03 05:09:56] [INFO ] Deduced a trap composed of 130 places in 126 ms
[2020-06-03 05:09:56] [INFO ] Deduced a trap composed of 125 places in 101 ms
[2020-06-03 05:09:56] [INFO ] Deduced a trap composed of 118 places in 102 ms
[2020-06-03 05:09:56] [INFO ] Deduced a trap composed of 128 places in 99 ms
[2020-06-03 05:09:56] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 8760 ms
[2020-06-03 05:09:56] [INFO ] [Real]Absence check using 48 positive place invariants in 28 ms returned sat
[2020-06-03 05:09:56] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-06-03 05:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:57] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2020-06-03 05:09:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:09:57] [INFO ] [Nat]Absence check using 48 positive place invariants in 36 ms returned sat
[2020-06-03 05:09:57] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-06-03 05:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:09:57] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2020-06-03 05:09:58] [INFO ] Deduced a trap composed of 12 places in 182 ms
[2020-06-03 05:09:58] [INFO ] Deduced a trap composed of 116 places in 129 ms
[2020-06-03 05:09:58] [INFO ] Deduced a trap composed of 10 places in 160 ms
[2020-06-03 05:09:58] [INFO ] Deduced a trap composed of 8 places in 163 ms
[2020-06-03 05:09:58] [INFO ] Deduced a trap composed of 13 places in 168 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 119 places in 157 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 122 places in 156 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 54 places in 153 ms
[2020-06-03 05:09:59] [INFO ] Deduced a trap composed of 49 places in 150 ms
[2020-06-03 05:10:00] [INFO ] Deduced a trap composed of 18 places in 163 ms
[2020-06-03 05:10:00] [INFO ] Deduced a trap composed of 52 places in 176 ms
[2020-06-03 05:10:00] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2020-06-03 05:10:00] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2020-06-03 05:10:00] [INFO ] Deduced a trap composed of 51 places in 149 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 43 places in 185 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 68 places in 140 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 68 places in 142 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 67 places in 142 ms
[2020-06-03 05:10:01] [INFO ] Deduced a trap composed of 130 places in 148 ms
[2020-06-03 05:10:02] [INFO ] Deduced a trap composed of 131 places in 156 ms
[2020-06-03 05:10:02] [INFO ] Deduced a trap composed of 122 places in 154 ms
[2020-06-03 05:10:02] [INFO ] Deduced a trap composed of 141 places in 139 ms
[2020-06-03 05:10:02] [INFO ] Deduced a trap composed of 134 places in 117 ms
[2020-06-03 05:10:02] [INFO ] Deduced a trap composed of 132 places in 148 ms
[2020-06-03 05:10:03] [INFO ] Deduced a trap composed of 128 places in 489 ms
[2020-06-03 05:10:03] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 05:10:03] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5356 ms
[2020-06-03 05:10:03] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 20 ms.
[2020-06-03 05:10:06] [INFO ] Added : 358 causal constraints over 72 iterations in 2931 ms. Result :sat
[2020-06-03 05:10:06] [INFO ] [Real]Absence check using 48 positive place invariants in 29 ms returned sat
[2020-06-03 05:10:06] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-06-03 05:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:06] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2020-06-03 05:10:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:10:07] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2020-06-03 05:10:07] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-06-03 05:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:07] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-06-03 05:10:07] [INFO ] Deduced a trap composed of 8 places in 141 ms
[2020-06-03 05:10:07] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 127 places in 150 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 13 places in 142 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 123 places in 159 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 13 places in 165 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 121 places in 134 ms
[2020-06-03 05:10:08] [INFO ] Deduced a trap composed of 122 places in 148 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 117 places in 151 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 122 places in 126 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 116 places in 121 ms
[2020-06-03 05:10:09] [INFO ] Deduced a trap composed of 134 places in 157 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 129 places in 139 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 132 places in 154 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 131 places in 149 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-06-03 05:10:10] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 120 places in 187 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 125 places in 145 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 130 places in 127 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 119 places in 154 ms
[2020-06-03 05:10:11] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-06-03 05:10:12] [INFO ] Deduced a trap composed of 125 places in 146 ms
[2020-06-03 05:10:12] [INFO ] Deduced a trap composed of 128 places in 151 ms
[2020-06-03 05:10:12] [INFO ] Deduced a trap composed of 124 places in 281 ms
[2020-06-03 05:10:12] [INFO ] Deduced a trap composed of 138 places in 280 ms
[2020-06-03 05:10:13] [INFO ] Deduced a trap composed of 116 places in 269 ms
[2020-06-03 05:10:13] [INFO ] Deduced a trap composed of 117 places in 278 ms
[2020-06-03 05:10:13] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-06-03 05:10:13] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6094 ms
[2020-06-03 05:10:13] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 23 ms.
[2020-06-03 05:10:16] [INFO ] Added : 326 causal constraints over 66 iterations in 2819 ms. Result :sat
[2020-06-03 05:10:16] [INFO ] [Real]Absence check using 48 positive place invariants in 79 ms returned sat
[2020-06-03 05:10:16] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 25 ms returned sat
[2020-06-03 05:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:17] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2020-06-03 05:10:17] [INFO ] Deduced a trap composed of 46 places in 169 ms
[2020-06-03 05:10:17] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-06-03 05:10:17] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-06-03 05:10:17] [INFO ] Deduced a trap composed of 26 places in 139 ms
[2020-06-03 05:10:18] [INFO ] Deduced a trap composed of 23 places in 776 ms
[2020-06-03 05:10:18] [INFO ] Deduced a trap composed of 42 places in 154 ms
[2020-06-03 05:10:19] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-03 05:10:19] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2020-06-03 05:10:20] [INFO ] Deduced a trap composed of 22 places in 959 ms
[2020-06-03 05:10:20] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-06-03 05:10:20] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2020-06-03 05:10:20] [INFO ] Deduced a trap composed of 106 places in 143 ms
[2020-06-03 05:10:25] [INFO ] Deduced a trap composed of 27 places in 4649 ms
[2020-06-03 05:10:25] [INFO ] Deduced a trap composed of 28 places in 135 ms
[2020-06-03 05:10:25] [INFO ] Deduced a trap composed of 40 places in 121 ms
[2020-06-03 05:10:25] [INFO ] Deduced a trap composed of 38 places in 151 ms
[2020-06-03 05:10:25] [INFO ] Deduced a trap composed of 122 places in 145 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 30 places in 140 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 33 places in 145 ms
[2020-06-03 05:10:26] [INFO ] Deduced a trap composed of 119 places in 180 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 37 places in 123 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 134 places in 145 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 119 places in 122 ms
[2020-06-03 05:10:27] [INFO ] Deduced a trap composed of 122 places in 141 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 124 places in 125 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 123 places in 132 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 129 places in 125 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 116 places in 128 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 119 places in 172 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 126 places in 158 ms
[2020-06-03 05:10:28] [INFO ] Deduced a trap composed of 123 places in 147 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 122 places in 129 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 121 places in 116 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 118 places in 145 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 113 places in 167 ms
[2020-06-03 05:10:29] [INFO ] Deduced a trap composed of 119 places in 156 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 42 places in 151 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 121 places in 144 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 128 places in 155 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 126 places in 124 ms
[2020-06-03 05:10:30] [INFO ] Deduced a trap composed of 111 places in 137 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 45 places in 162 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 123 places in 129 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 115 places in 146 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 129 places in 127 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 114 places in 118 ms
[2020-06-03 05:10:31] [INFO ] Deduced a trap composed of 123 places in 117 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 120 places in 118 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 130 places in 121 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 128 places in 121 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 134 places in 113 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 126 places in 116 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 123 places in 109 ms
[2020-06-03 05:10:32] [INFO ] Deduced a trap composed of 124 places in 118 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 126 places in 130 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 112 places in 126 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 28 places in 128 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 118 places in 124 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 126 places in 116 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 122 places in 111 ms
[2020-06-03 05:10:33] [INFO ] Deduced a trap composed of 127 places in 119 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 121 places in 119 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 120 places in 126 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 126 places in 127 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 117 places in 121 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 118 places in 112 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 37 places in 120 ms
[2020-06-03 05:10:34] [INFO ] Deduced a trap composed of 119 places in 143 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 43 places in 134 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 129 places in 129 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 114 places in 131 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 122 places in 117 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 111 places in 146 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 115 places in 128 ms
[2020-06-03 05:10:35] [INFO ] Deduced a trap composed of 109 places in 135 ms
[2020-06-03 05:10:36] [INFO ] Deduced a trap composed of 47 places in 132 ms
[2020-06-03 05:10:36] [INFO ] Deduced a trap composed of 109 places in 144 ms
[2020-06-03 05:10:36] [INFO ] Deduced a trap composed of 116 places in 148 ms
[2020-06-03 05:10:36] [INFO ] Deduced a trap composed of 102 places in 130 ms
[2020-06-03 05:10:36] [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 s36 s37 s38 s57 s58 s59 s60 s61 s62 s64 s65 s68 s69 s117 s118 s119 s123 s124 s125 s198 s238 s242 s244 s247 s249 s262 s263 s264 s277 s278 s279 s288 s293 s298 s313 s318 s328 s347 s348 s349 s352 s354 s362 s363 s364 s365 s366 s367 s368 s371 s372 s373 s374 s375 s376 s377 s378 s383 s384 s387 s388 s389 s404 s405 s417 s418 s419 s420 s421 s422 s424 s425 s426 s427 s428 s429 s430 s431 s440 s441 s444 s445 s446 s447 s448 s449 s468 s469 s473 s474 s475 s476 s477 s478 s479 s480 s481) 0)") while checking expression at index 5
[2020-06-03 05:10:36] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2020-06-03 05:10:36] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 29 ms returned sat
[2020-06-03 05:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:37] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 28 places in 56 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2020-06-03 05:10:37] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-06-03 05:10:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 666 ms
[2020-06-03 05:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:10:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 34 ms returned sat
[2020-06-03 05:10:38] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 15 ms returned sat
[2020-06-03 05:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:38] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-06-03 05:10:38] [INFO ] Deduced a trap composed of 11 places in 123 ms
[2020-06-03 05:10:38] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 05:10:38] [INFO ] Deduced a trap composed of 17 places in 70 ms
[2020-06-03 05:10:38] [INFO ] Deduced a trap composed of 18 places in 71 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 24 places in 68 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 47 places in 87 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 49 places in 87 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 28 places in 61 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 35 places in 52 ms
[2020-06-03 05:10:39] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-06-03 05:10:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1147 ms
[2020-06-03 05:10:39] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 30 ms.
[2020-06-03 05:10:43] [INFO ] Added : 365 causal constraints over 74 iterations in 3492 ms. Result :sat
[2020-06-03 05:10:43] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2020-06-03 05:10:43] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-06-03 05:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:10:43] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2020-06-03 05:10:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:10:44] [INFO ] [Nat]Absence check using 48 positive place invariants in 49 ms returned sat
[2020-06-03 05:10:44] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 05:10:44] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 05:10:44] [INFO ] Flatten gal took : 95 ms
[2020-06-03 05:10:44] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 05:10:44] [INFO ] Flatten gal took : 22 ms
FORMULA BusinessProcesses-PT-10-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:10:44] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 05:10:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-10 @ 3570 seconds

FORMULA BusinessProcesses-PT-10-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-10-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ BusinessProcesses-PT-10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:10:44 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(EX((((p337 <= 0)) OR ((1 <= p96)))))",
"processed_size": 40,
"rewrites": 21
},
"net":
{
"conflict_clusters": 388,
"singleton_clusters": 0
},
"result":
{
"edges": 306,
"markings": 304,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p62)) AND ((p150 <= 0)))",
"processed_size": 32,
"rewrites": 21
},
"result":
{
"edges": 193,
"markings": 192,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((((p57 <= 0)) OR ((p380 <= 1) AND (1 <= p380))))",
"processed_size": 52,
"rewrites": 20
},
"net":
{
"conflict_clusters": 388,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p122)) AND ((p4 <= 0)))",
"processed_size": 31,
"rewrites": 22
},
"result":
{
"edges": 97,
"markings": 97,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p15 <= 0))))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p48))))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 312,
"markings": 309,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p75) AND (((p364 <= 0)) OR ((1 <= p277))))))",
"processed_size": 58,
"rewrites": 20
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p324 <= 0)) OR ((1 <= p509)) OR ((p53 <= 0)) OR ((1 <= p372)))))",
"processed_size": 76,
"rewrites": 21
},
"result":
{
"edges": 158,
"markings": 157,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((((p76 <= 0)) OR ((1 <= p248))) AND (((p26 <= 0)) OR ((1 <= p413)) OR ((((p172 <= 0)) OR ((1 <= p167))) AND (((p428 <= 0)) OR ((1 <= p394))))))))",
"processed_size": 157,
"rewrites": 21
},
"result":
{
"edges": 111,
"markings": 111,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p153)) AND ((p128 <= 0)))",
"processed_size": 33,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p165)) AND ((p250 <= 0)) AND ((1 <= p116)) AND ((p107 <= 0)))))",
"processed_size": 77,
"rewrites": 20
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (((((p363 <= 0)) OR ((1 <= p470)) OR ((p254 <= 0)) OR ((1 <= p214))) OR (G (((p28 <= 1) AND (1 <= p28))) OR (((1 <= p256)) AND ((p375 <= 0))))))",
"processed_size": 149,
"rewrites": 21
},
"result":
{
"edges": 3293,
"markings": 3008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 32504,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((** OR (A(G(**)) OR **)))) : A(G(*)) : (E(F(*)) OR **) : A(G(E(X(**)))) : E(F(**)) : A(G(**)) : DEADLOCK : E(X(E(F(*)))) : (A(X(A(G(**)))) AND A(X(**))) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1415,
"conflict_clusters": 388,
"places": 518,
"places_significant": 433,
"singleton_clusters": 0,
"transitions": 471
},
"result":
{
"preliminary_value": "no no yes no yes no no yes no yes no ",
"value": "no no yes no yes no no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 989/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 518
lola: finding significant places
lola: 518 places, 471 transitions, 433 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p470 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p509 <= 1)
lola: LP says that atomic proposition is always true: (p372 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: A (G ((((((p363 <= 0)) OR ((1 <= p470)) OR ((p254 <= 0)) OR ((1 <= p214))) OR A (G (((p28 <= 1) AND (1 <= p28))))) OR (((1 <= p256)) AND ((p375 <= 0)))))) : NOT(E (F (((1 <= p15))))) : (NOT(A (G ((((p165 <= 0)) OR ((1 <= p250)) OR ((p116 <= 0)) OR ((1 <= p107)))))) OR (((1 <= p153)) AND ((p128 <= 0)))) : A (G (E (X ((((p337 <= 0)) OR ((1 <= p96))))))) : E (F (A (F (((1 <= p75) AND (((p364 <= 0)) OR ((1 <= p277)))))))) : A (G ((((p324 <= 0)) OR ((1 <= p509)) OR ((p53 <= 0)) OR ((1 <= p372))))) : A (X (E (G ((1 <= 0))))) : NOT(A (X (A (G ((((p62 <= 0)) OR ((1 <= p150)))))))) : A (X ((A (G ((((p122 <= 0)) OR ((1 <= p4))))) AND (((p57 <= 0)) OR ((p380 <= 1) AND (1 <= p380)))))) : E ((((1 <= p394)) U E (F (((1 <= p48)))))) : A (G (((((p76 <= 0)) OR ((1 <= p248))) AND (((p26 <= 0)) OR ((1 <= p413)) OR ((((p172 <= 0)) OR ((1 <= p167))) AND (((p428 <= 0)) OR ((1 <= p394))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p337 <= 0)) OR ((1 <= p96)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p337 <= 0)) OR ((1 <= p96)))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 304 markings, 306 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p62)) AND ((p150 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p62)) AND ((p150 <= 0)))
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p62)) AND ((p150 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 192 markings, 193 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((((p122 <= 0)) OR ((1 <= p4))))))) AND A (X ((((p57 <= 0)) OR ((p380 <= 1) AND (1 <= p380))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p57 <= 0)) OR ((p380 <= 1) AND (1 <= p380)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
sara: try reading problem file CTLCardinality-2-0.sara.
lola: processed formula: AX((((p57 <= 0)) OR ((p380 <= 1) AND (1 <= p380))))
lola: processed formula length: 52
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((((p122 <= 0)) OR ((1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p122)) AND ((p4 <= 0)))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p122)) AND ((p4 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 97 markings, 97 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p15 <= 0))))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p48))))
lola: processed formula length: 20
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p48))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 309 markings, 312 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p75) AND (((p364 <= 0)) OR ((1 <= p277))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p75) AND (((p364 <= 0)) OR ((1 <= p277))))))
lola: processed formula length: 58
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p75) AND (((p364 <= 0)) OR ((1 <= p277))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p324 <= 0)) OR ((1 <= p509)) OR ((p53 <= 0)) OR ((1 <= p372)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p324 <= 0)) OR ((1 <= p509)) OR ((p53 <= 0)) OR ((1 <= p372)))))
lola: processed formula length: 76
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p324)) AND ((p509 <= 0)) AND ((1 <= p53)) AND ((p372 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 157 markings, 158 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p76 <= 0)) OR ((1 <= p248))) AND (((p26 <= 0)) OR ((1 <= p413)) OR ((((p172 <= 0)) OR ((1 <= p167))) AND (((p428 <= 0)) OR ((1 <= p394))))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p76 <= 0)) OR ((1 <= p248))) AND (((p26 <= 0)) OR ((1 <= p413)) OR ((((p172 <= 0)) OR ((1 <= p167))) AND (((p428 <= 0)) OR ((1 <= p394))))))))
lola: processed formula length: 157
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 111 markings, 111 edges
lola: ========================================
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p165)) AND ((p250 <= 0)) AND ((1 <= p116)) AND ((p107 <= 0))))) OR (((1 <= p153)) AND ((p128 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p153)) AND ((p128 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p153)) AND ((p128 <= 0)))
lola: processed formula length: 33
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p165)) AND ((p250 <= 0)) AND ((1 <= p116)) AND ((p107 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p165)) AND ((p250 <= 0)) AND ((1 <= p116)) AND ((p107 <= 0)))))
lola: processed formula length: 77
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 127 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p363 <= 0)) OR ((1 <= p470)) OR ((p254 <= 0)) OR ((1 <= p214))) OR (A (G (((p28 <= 1) AND (1 <= p28)))) OR (((1 <= p256)) AND ((p375 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p363 <= 0)) OR ((1 <= p470)) OR ((p254 <= 0)) OR ((1 <= p214))) OR (G (((p28 <= 1) AND (1 <= p28))) OR (((1 <= p256)) AND ((p375 <= 0))))))
lola: processed formula length: 149
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 3008 markings, 3293 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no yes no yes no
lola:
preliminary result: no no yes no yes no no yes no yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 32504 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 152580 kB
After kill :
MemTotal: 16427364 kB
MemFree: 157656 kB

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

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-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-10, 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 r182-oct2-158987914000523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 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 ;