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

--------------------
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 1589251888575

[2020-05-12 02:51:31] [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:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:51:31] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-05-12 02:51:31] [INFO ] Transformed 518 places.
[2020-05-12 02:51:31] [INFO ] Transformed 471 transitions.
[2020-05-12 02:51:31] [INFO ] Found NUPN structural information;
[2020-05-12 02:51:31] [INFO ] Parsed PT model containing 518 places and 471 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 107 ms.
Incomplete random walk after 100000 steps, including 813 resets, run finished after 272 ms. (steps per millisecond=367 ) properties seen :[1, 1, 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-05-12 02:51:32] [INFO ] Computed 85 place invariants in 47 ms
[2020-05-12 02:51:32] [INFO ] [Real]Absence check using 48 positive place invariants in 47 ms returned sat
[2020-05-12 02:51:32] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 24 ms returned sat
[2020-05-12 02:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:33] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-05-12 02:51:34] [INFO ] Deduced a trap composed of 9 places in 1550 ms
[2020-05-12 02:51:34] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 16 places in 145 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 123 places in 164 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 23 places in 149 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 15 places in 308 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 39 places in 214 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 54 places in 206 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 36 places in 217 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 41 places in 162 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 113 places in 147 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 26 places in 169 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 41 places in 220 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 42 places in 159 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 29 places in 97 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2020-05-12 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4834 ms
[2020-05-12 02:51:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:51:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 385 ms returned sat
[2020-05-12 02:51:38] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 40 ms returned sat
[2020-05-12 02:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:39] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 10 places in 233 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 9 places in 190 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 17 places in 172 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 17 places in 180 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 131 places in 199 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 39 places in 158 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 39 places in 169 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 44 places in 218 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 15 places in 243 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 32 places in 159 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 127 places in 152 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 19 places in 145 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 32 places in 226 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 36 places in 135 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 37 places in 73 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 33 places in 635 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2020-05-12 02:51:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4686 ms
[2020-05-12 02:51:43] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 48 ms.
[2020-05-12 02:51:48] [INFO ] Added : 371 causal constraints over 75 iterations in 4730 ms. Result :sat
[2020-05-12 02:51:48] [INFO ] [Real]Absence check using 48 positive place invariants in 33 ms returned sat
[2020-05-12 02:51:48] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-05-12 02:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:49] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-05-12 02:51:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:51:49] [INFO ] [Nat]Absence check using 48 positive place invariants in 62 ms returned sat
[2020-05-12 02:51:49] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 60 ms returned sat
[2020-05-12 02:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:51] [INFO ] [Nat]Absence check using state equation in 1629 ms returned sat
[2020-05-12 02:51:51] [INFO ] Deduced a trap composed of 11 places in 261 ms
[2020-05-12 02:51:52] [INFO ] Deduced a trap composed of 132 places in 509 ms
[2020-05-12 02:51:52] [INFO ] Deduced a trap composed of 8 places in 350 ms
[2020-05-12 02:51:52] [INFO ] Deduced a trap composed of 15 places in 361 ms
[2020-05-12 02:51:53] [INFO ] Deduced a trap composed of 32 places in 575 ms
[2020-05-12 02:51:53] [INFO ] Deduced a trap composed of 26 places in 235 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 115 places in 362 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 31 places in 325 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 17 places in 294 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 125 places in 302 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 115 places in 653 ms
[2020-05-12 02:51:57] [INFO ] Deduced a trap composed of 19 places in 1669 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 120 places in 531 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 34 places in 730 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 33 places in 330 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 15 places in 277 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 120 places in 208 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 111 places in 195 ms
[2020-05-12 02:52:02] [INFO ] Deduced a trap composed of 33 places in 2266 ms
[2020-05-12 02:52:02] [INFO ] Deduced a trap composed of 38 places in 317 ms
[2020-05-12 02:52:03] [INFO ] Deduced a trap composed of 18 places in 279 ms
[2020-05-12 02:52:03] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 11919 ms
[2020-05-12 02:52:03] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 49 ms.
[2020-05-12 02:52:06] [INFO ] Added : 319 causal constraints over 65 iterations in 2933 ms. Result :sat
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 118 places in 373 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 126 places in 303 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 126 places in 352 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 126 places in 271 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 134 places in 292 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 129 places in 173 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 118 places in 163 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 115 places in 147 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 118 places in 140 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 113 places in 218 ms
[2020-05-12 02:52: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 s43 s44 s60 s61 s62 s73 s79 s80 s117 s118 s119 s123 s124 s125 s129 s130 s131 s135 s136 s137 s150 s152 s164 s167 s170 s171 s238 s247 s249 s258 s262 s263 s264 s268 s273 s278 s283 s298 s317 s319 s322 s323 s324 s328 s333 s338 s343 s348 s353 s362 s365 s366 s367 s368 s371 s372 s373 s374 s375 s376 s381 s382 s383 s384 s387 s388 s389 s390 s391 s404 s405 s417 s418 s421 s422 s424 s425 s426 s427 s428 s429 s434 s435 s438 s439 s442 s443 s448 s449 s452 s453 s457 s459 s461 s464 s471 s472 s475 s476 s477 s478 s479 s480 s481 s500 s506 s515) 0)") while checking expression at index 1
[2020-05-12 02:52:09] [INFO ] [Real]Absence check using 48 positive place invariants in 27 ms returned sat
[2020-05-12 02:52:09] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 21 ms returned sat
[2020-05-12 02:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:11] [INFO ] [Real]Absence check using state equation in 1591 ms returned sat
[2020-05-12 02:52:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:11] [INFO ] [Nat]Absence check using 48 positive place invariants in 172 ms returned sat
[2020-05-12 02:52:11] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 87 ms returned sat
[2020-05-12 02:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:14] [INFO ] [Nat]Absence check using state equation in 2517 ms returned sat
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 12 places in 2814 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 116 places in 1833 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 10 places in 5043 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 8 places in 825 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 13 places in 305 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 119 places in 289 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 122 places in 188 ms
[2020-05-12 02:52:26] [INFO ] Deduced a trap composed of 23 places in 237 ms
[2020-05-12 02:52:26] [INFO ] Deduced a trap composed of 54 places in 155 ms
[2020-05-12 02:52:26] [INFO ] Deduced a trap composed of 49 places in 155 ms
[2020-05-12 02:52:26] [INFO ] Deduced a trap composed of 18 places in 151 ms
[2020-05-12 02:52:26] [INFO ] Deduced a trap composed of 52 places in 154 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 43 places in 169 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 37 places in 147 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 51 places in 150 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 68 places in 145 ms
[2020-05-12 02:52:29] [INFO ] Deduced a trap composed of 68 places in 1248 ms
[2020-05-12 02:52:29] [INFO ] Deduced a trap composed of 67 places in 153 ms
[2020-05-12 02:52:29] [INFO ] Deduced a trap composed of 130 places in 140 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 131 places in 469 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 122 places in 400 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 141 places in 194 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 134 places in 172 ms
[2020-05-12 02:52:33] [INFO ] Deduced a trap composed of 132 places in 2528 ms
[2020-05-12 02:52:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s28 s29 s34 s35 s36 s37 s38 s43 s44 s48 s49 s50 s60 s61 s62 s73 s79 s80 s82 s83 s141 s142 s143 s150 s153 s154 s155 s156 s157 s158 s159 s161 s162 s163 s164 s165 s166 s167 s168 s169 s180 s181 s182 s186 s187 s188 s195 s196 s197 s247 s249 s252 s254 s268 s278 s283 s288 s293 s317 s319 s323 s333 s353 s358 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s385 s386 s392 s393 s398 s399 s404 s405 s406 s407 s412 s413 s414 s415 s416 s417 s418 s423 s424 s425 s426 s427 s428 s429 s432 s433 s436 s437 s440 s441 s442 s443 s444 s445 s450 s451 s452 s453 s455 s475 s476 s479 s487 s488 s489 s490 s491) 0)") while checking expression at index 2
[2020-05-12 02:52:33] [INFO ] [Real]Absence check using 48 positive place invariants in 180 ms returned sat
[2020-05-12 02:52:33] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 61 ms returned sat
[2020-05-12 02:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:35] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2020-05-12 02:52:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:36] [INFO ] [Nat]Absence check using 48 positive place invariants in 51 ms returned sat
[2020-05-12 02:52:36] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:39] [INFO ] [Nat]Absence check using state equation in 2815 ms returned sat
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 8 places in 1996 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 11 places in 2523 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 127 places in 322 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 13 places in 317 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 123 places in 286 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 13 places in 726 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 121 places in 326 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 122 places in 320 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 27 places in 282 ms
[2020-05-12 02:52:47] [INFO ] Deduced a trap composed of 27 places in 1057 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 117 places in 4336 ms
[2020-05-12 02:52:55] [INFO ] Deduced a trap composed of 122 places in 3792 ms
[2020-05-12 02:52:59] [INFO ] Deduced a trap composed of 116 places in 3483 ms
[2020-05-12 02:52:59] [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 s34 s35 s43 s44 s51 s52 s53 s86 s87 s88 s92 s147 s148 s149 s150 s154 s161 s162 s163 s164 s165 s166 s167 s180 s238 s247 s249 s262 s263 s264 s267 s269 s273 s283 s302 s304 s307 s309 s313 s328 s332 s333 s334 s337 s338 s339 s358 s362 s365 s366 s367 s368 s371 s372 s373 s374 s375 s376 s381 s382 s383 s384 s387 s390 s391 s394 s395 s404 s405 s410 s411 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s428 s429 s432 s433 s442 s443 s444 s445 s455 s459 s460 s461 s471 s472 s473 s474 s475 s476 s479 s485 s486 s488 s489 s490 s491 s506 s512 s513 s514) 0)") while checking expression at index 3
[2020-05-12 02:52:59] [INFO ] [Real]Absence check using 48 positive place invariants in 89 ms returned sat
[2020-05-12 02:52:59] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 167 ms returned sat
[2020-05-12 02:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:02] [INFO ] [Real]Absence check using state equation in 2706 ms returned sat
[2020-05-12 02:53:04] [INFO ] Deduced a trap composed of 46 places in 1603 ms
[2020-05-12 02:53:04] [INFO ] Deduced a trap composed of 10 places in 351 ms
[2020-05-12 02:53:04] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-05-12 02:53:04] [INFO ] Deduced a trap composed of 26 places in 160 ms
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 23 places in 767 ms
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 42 places in 164 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 28 places in 206 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 15 places in 170 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 22 places in 175 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 23 places in 155 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 106 places in 155 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 27 places in 152 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 28 places in 150 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 40 places in 146 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 38 places in 454 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 122 places in 393 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 24 places in 452 ms
[2020-05-12 02:53:10] [INFO ] Deduced a trap composed of 30 places in 1015 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 25 places in 1407 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 22 places in 389 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 33 places in 792 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 119 places in 408 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 21 places in 758 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 37 places in 297 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 134 places in 174 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 119 places in 206 ms
[2020-05-12 02:53:15] [INFO ] Deduced a trap composed of 122 places in 161 ms
[2020-05-12 02:53:15] [INFO ] Deduced a trap composed of 124 places in 149 ms
[2020-05-12 02:53:15] [INFO ] Deduced a trap composed of 123 places in 510 ms
[2020-05-12 02:53:16] [INFO ] Deduced a trap composed of 129 places in 153 ms
[2020-05-12 02:53:16] [INFO ] Deduced a trap composed of 116 places in 153 ms
[2020-05-12 02:53:16] [INFO ] Deduced a trap composed of 119 places in 605 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 126 places in 5627 ms
[2020-05-12 02:53:22] [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 s36 s41 s42 s57 s58 s59 s73 s76 s77 s117 s118 s119 s123 s124 s125 s129 s130 s131 s135 s136 s137 s147 s148 s149 s150 s152 s154 s158 s167 s177 s183 s192 s237 s238 s239 s242 s244 s248 s278 s287 s289 s303 s313 s317 s318 s319 s328 s337 s338 s339 s343 s348 s362 s363 s364 s365 s366 s367 s368 s371 s372 s373 s374 s377 s378 s379 s380 s383 s384 s387 s388 s389 s392 s393 s396 s397 s398 s399 s400 s401 s404 s405 s408 s409 s414 s415 s416 s421 s422 s424 s425 s428 s429 s430 s431 s434 s435 s438 s439 s446 s447 s448 s449 s459 s462 s463 s464 s467 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s484 s509) 0)") while checking expression at index 4
[2020-05-12 02:53:22] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2020-05-12 02:53:22] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 178 ms returned sat
[2020-05-12 02:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:23] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2020-05-12 02:53:23] [INFO ] Deduced a trap composed of 8 places in 236 ms
[2020-05-12 02:53:23] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 16 places in 152 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-05-12 02:53:28] [INFO ] Deduced a trap composed of 24 places in 3772 ms
[2020-05-12 02:53:28] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-05-12 02:53:28] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2020-05-12 02:53:28] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2020-05-12 02:53:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4976 ms
[2020-05-12 02:53:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:28] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2020-05-12 02:53:28] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-05-12 02:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:29] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 11 places in 895 ms
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 18 places in 182 ms
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-05-12 02:53:30] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-05-12 02:53:31] [INFO ] Deduced a trap composed of 24 places in 188 ms
[2020-05-12 02:53:31] [INFO ] Deduced a trap composed of 47 places in 190 ms
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 49 places in 991 ms
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 28 places in 353 ms
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 35 places in 52 ms
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-05-12 02:53:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3750 ms
[2020-05-12 02:53:33] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 69 ms.
[2020-05-12 02:53:37] [INFO ] Added : 365 causal constraints over 74 iterations in 4726 ms. Result :sat
[2020-05-12 02:53:37] [INFO ] [Real]Absence check using 48 positive place invariants in 27 ms returned sat
[2020-05-12 02:53:37] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 36 ms returned sat
[2020-05-12 02:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:38] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2020-05-12 02:53:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:39] [INFO ] [Nat]Absence check using 48 positive place invariants in 61 ms returned sat
[2020-05-12 02:53:39] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 25 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 02:53:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 02:53:39] [INFO ] Flatten gal took : 116 ms
[2020-05-12 02:53:39] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 02:53:39] [INFO ] Flatten gal took : 57 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-05-12 02:53:39] [INFO ] Applying decomposition
[2020-05-12 02:53:39] [INFO ] Flatten gal took : 36 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/graph15739255589513176884.txt, -o, /tmp/graph15739255589513176884.bin, -w, /tmp/graph15739255589513176884.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/graph15739255589513176884.bin, -l, -1, -v, -w, /tmp/graph15739255589513176884.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:53:40] [INFO ] Decomposing Gal with order
[2020-05-12 02:53:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:53:40] [INFO ] Removed a total of 255 redundant transitions.
[2020-05-12 02:53:40] [INFO ] Flatten gal took : 125 ms
[2020-05-12 02:53:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 22 ms.
[2020-05-12 02:53:40] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 22 ms
[2020-05-12 02:53:40] [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 11 CTL formulae.
built 51 ordering constraints for composite.
built 21 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 61 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 24 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 29 ordering constraints for composite.
built 32 ordering constraints for composite.
built 43 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08336e+25,276.428,3584908,14437,85,3.77238e+06,851,1217,1.71559e+07,83,3154,0


Converting to forward existential form...Done !
original formula: AG(((((((i15.u143.p363==0)||(i14.i2.u190.p470==1))||(i8.i3.u99.p254==0))||(i5.i0.u83.p214==1)) + AG((i0.i1.u13.p28==1))) + ((i8.i4.u101.p256!=0)&&(i15.u147.p375!=1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((i8.i4.u101.p256!=0)&&(i15.u147.p375!=1)))) * !(((((i15.u143.p363==0)||(i14.i2.u190.p470==1))||(i8.i3.u99.p254==0))||(i5.i0.u83.p214==1)))),TRUE) * !((i0.i1.u13.p28==1)))] = FALSE
(forward)formula 0,0,331.083,3585232,1,0,3.77238e+06,851,2815,1.71559e+07,146,3154,1248570
FORMULA BusinessProcesses-PT-10-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((i10.i0.u8.p15==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i10.i0.u8.p15==1))] = FALSE
(forward)formula 1,0,331.19,3585232,1,0,3.77238e+06,851,2818,1.71559e+07,146,3154,1254474
FORMULA BusinessProcesses-PT-10-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(((((i14.i2.u65.p165==0)||(i8.i2.u98.p250==1))||(i3.i2.u47.p116==0))||(i13.u44.p107==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i14.i2.u65.p165==0)||(i8.i2.u98.p250==1))||(i3.i2.u47.p116==0))||(i13.u44.p107==1))))] != FALSE
(forward)formula 2,1,331.469,3585232,1,0,3.77238e+06,851,2836,1.71559e+07,147,3154,1266194
FORMULA BusinessProcesses-PT-10-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EX(((i5.i4.u133.p337==0)||(i2.i0.u39.p96==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((i5.i4.u133.p337==0)||(i2.i0.u39.p96==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t236, t262, t336, i0.i0.t344, i0.i0.u11.t354, i0.i0.u15.t347, i0.i1.t349, i0.i1.t351, i0.i1.u16.t345, i0.i2.t222, i0.i2.u96.t223, i0.i3.t101, i0.i3.t105, i0.i3.u150.t107, i1.i0.t339, i1.i0.t341, i1.i0.u17.t343, i1.i1.t202, i1.i1.u105.t203, i2.i0.u34.t309, i2.i2.t178, i2.i2.u117.t179, i3.i0.u29.t317, i3.i2.u47.t285, i4.i1.t232, i4.i1.u57.t265, i4.i1.u77.t235, i4.i2.u79.t231, i4.i3.t130, i4.i3.u141.t131, i5.i2.t158, i5.i2.u127.t159, i5.i3.t154, i5.i3.u130.t155, i5.i4.t146, i5.i4.u133.t147, i5.i5.t134, i5.i5.u139.t135, i6.i1.t174, i6.i1.u119.t175, i6.i2.t170, i6.i2.u121.t171, i6.i3.t166, i6.i3.u123.t167, i6.i4.t162, i6.i4.u125.t163, i7.i1.t198, i7.i1.u108.t199, i7.i2.t194, i7.i2.u109.t195, i7.i3.t190, i7.i3.u112.t191, i7.i4.t186, i7.i4.u114.t187, i8.i1.t225, i8.i1.u93.t226, i8.i2.t218, i8.i2.u97.t219, i8.i3.t214, i8.i3.u99.t215, i8.i4.t210, i8.i4.u102.t211, i8.i5.t206, i8.i5.u103.t207, i9.t328, i9.u21.t335, i9.u23.t331, i10.i0.t318, i10.i0.u25.t327, i10.i0.u27.t319, i10.i0.u27.t323, i10.i0.u28.t321, i10.i1.t79, i10.i1.u164.t83, i11.t182, i11.u116.t183, i12.i0.t266, i12.i0.u49.t281, i12.i0.u51.t277, i12.i0.u55.t269, i12.i1.u53.t273, i13.t297, i13.t295, i13.t293, i13.t290, i13.t288, i13.u40.t301, i14.t241, i14.t239, i14.i0.t150, i14.i0.t243, i14.i0.u59.t247, i14.i0.u59.t251, i14.i0.u59.t255, i14.i0.u59.t261, i14.i0.u132.t151, i14.i1.t142, i14.i1.u135.t143, i14.i2.t138, i14.i2.u138.t139, i15.t124, i15.t117, i15.t110, i15.t103, i15.t99, i15.t97, i15.t95, i15.t92, i15.t89, i15.t86, i15.t81, i15.t77, i15.t75, i15.t73, i15.t64, i15.t62, i15.t60, i15.t57, i15.t54, i15.t51, i15.t48, i15.t45, i15.t17, i15.t14, i15.u147.t12, i15.u147.t28, i15.u147.t32, i15.u147.t36, i15.u147.t42, i15.u147.t71, i15.u147.t112, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/301/132/469
(forward)formula 3,0,391.65,3585232,1,0,3.77238e+06,1317,8167,1.97083e+07,415,5270,5185077
FORMULA BusinessProcesses-PT-10-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i3.i0.u30.p75==1)&&((i15.u143.p364==0)||(i7.i2.u109.p277==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i3.i0.u30.p75==1)&&((i15.u143.p364==0)||(i7.i2.u109.p277==1))))] != FALSE
(forward)formula 4,1,391.875,3585232,1,0,3.77238e+06,1317,8178,1.97173e+07,416,5270,5200172
FORMULA BusinessProcesses-PT-10-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((i5.i2.u127.p324==0)||(i14.i2.u187.p509==1))||(i9.u23.p53==0))||(i15.u146.p372==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i5.i2.u127.p324==0)||(i14.i2.u187.p509==1))||(i9.u23.p53==0))||(i15.u146.p372==1))))] = FALSE
(forward)formula 5,0,392.159,3585232,1,0,3.77238e+06,1317,8193,1.97419e+07,416,5270,5211955
FORMULA BusinessProcesses-PT-10-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 6,0,392.197,3585232,1,0,3.77238e+06,1317,8315,1.97419e+07,423,5270,5212511
FORMULA BusinessProcesses-PT-10-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(AG(((i10.i0.u26.p62==0)||(i14.i0.u59.p150==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((i10.i0.u26.p62==0)||(i14.i0.u59.p150==1))))] != FALSE
(forward)formula 7,1,1064.43,11605976,1,0,1.25444e+07,1348,3730,5.04438e+07,217,5714,977840
FORMULA BusinessProcesses-PT-10-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AG(((i12.i0.u49.p122==0)||(i4.i1.u3.p4==1))) * ((i10.i0.u25.p57==0)||(i0.i0.u149.p380==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(((i12.i0.u49.p122==0)||(i4.i1.u3.p4==1))))] = FALSE * [(EY(Init) * !(((i10.i0.u25.p57==0)||(i0.i0.u149.p380==1))))] = FALSE)
(forward)formula 8,0,1064.64,11605976,1,0,1.25444e+07,1348,3886,5.04438e+07,227,5714,991882
FORMULA BusinessProcesses-PT-10-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-12 03:14:22] [INFO ] Applying decomposition
[2020-05-12 03:14:22] [INFO ] Flatten gal took : 27 ms
[2020-05-12 03:14:22] [INFO ] Decomposing Gal with order
[2020-05-12 03:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:14:22] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 03:14:22] [INFO ] Flatten gal took : 44 ms
[2020-05-12 03:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 22 ms.
[2020-05-12 03:14:22] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 19 ms
[2020-05-12 03:14:22] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/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 2 CTL formulae.
built 2 ordering constraints for composite.
built 115 ordering constraints for composite.
built 65 ordering constraints for composite.
built 64 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 29 ordering constraints for composite.
built 25 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 73 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 03:35:07] [INFO ] Flatten gal took : 456 ms
[2020-05-12 03:35:08] [INFO ] Input system was already deterministic with 471 transitions.
[2020-05-12 03:35:08] [INFO ] Transformed 518 places.
[2020-05-12 03:35:09] [INFO ] Transformed 471 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-12 03:35:39] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 7 ms
[2020-05-12 03:35:39] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 16 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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-10"
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-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 r021-oct2-158897699200523"
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 ;