Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167800120.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167800120
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K May 5 16:51 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-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620908075714

[2021-05-13 12:14:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 12:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:14:38] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2021-05-13 12:14:38] [INFO ] Transformed 782 places.
[2021-05-13 12:14:38] [INFO ] Transformed 697 transitions.
[2021-05-13 12:14:38] [INFO ] Found NUPN structural information;
[2021-05-13 12:14:38] [INFO ] Parsed PT model containing 782 places and 697 transitions in 166 ms.
Deduced a syphon composed of 63 places in 24 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 74 ms.
Incomplete random walk after 100000 steps, including 503 resets, run finished after 699 ms. (steps per millisecond=143 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 638 rows 719 cols
[2021-05-13 12:14:39] [INFO ] Computed 121 place invariants in 74 ms
[2021-05-13 12:14:39] [INFO ] [Real]Absence check using 78 positive place invariants in 108 ms returned sat
[2021-05-13 12:14:39] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2021-05-13 12:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:40] [INFO ] [Real]Absence check using state equation in 966 ms returned unsat
[2021-05-13 12:14:40] [INFO ] [Real]Absence check using 78 positive place invariants in 57 ms returned sat
[2021-05-13 12:14:41] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 25 ms returned sat
[2021-05-13 12:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:42] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2021-05-13 12:14:43] [INFO ] Deduced a trap composed of 23 places in 735 ms
[2021-05-13 12:14:44] [INFO ] Deduced a trap composed of 11 places in 1249 ms
[2021-05-13 12:14:45] [INFO ] Deduced a trap composed of 133 places in 529 ms
[2021-05-13 12:14:45] [INFO ] Deduced a trap composed of 11 places in 445 ms
[2021-05-13 12:14:46] [INFO ] Deduced a trap composed of 23 places in 498 ms
[2021-05-13 12:14:46] [INFO ] Deduced a trap composed of 29 places in 348 ms
[2021-05-13 12:14:47] [INFO ] Deduced a trap composed of 41 places in 345 ms
[2021-05-13 12:14:47] [INFO ] Deduced a trap composed of 28 places in 288 ms
[2021-05-13 12:14:47] [INFO ] Deduced a trap composed of 48 places in 337 ms
[2021-05-13 12:14:48] [INFO ] Deduced a trap composed of 139 places in 290 ms
[2021-05-13 12:14:48] [INFO ] Deduced a trap composed of 26 places in 445 ms
[2021-05-13 12:14:49] [INFO ] Deduced a trap composed of 16 places in 515 ms
[2021-05-13 12:14:49] [INFO ] Deduced a trap composed of 21 places in 469 ms
[2021-05-13 12:14:49] [INFO ] Deduced a trap composed of 145 places in 297 ms
[2021-05-13 12:14:50] [INFO ] Deduced a trap composed of 138 places in 254 ms
[2021-05-13 12:14:50] [INFO ] Deduced a trap composed of 142 places in 242 ms
[2021-05-13 12:14:50] [INFO ] Deduced a trap composed of 25 places in 239 ms
[2021-05-13 12:14:51] [INFO ] Deduced a trap composed of 114 places in 242 ms
[2021-05-13 12:14:51] [INFO ] Deduced a trap composed of 114 places in 216 ms
[2021-05-13 12:14:51] [INFO ] Deduced a trap composed of 33 places in 249 ms
[2021-05-13 12:14:51] [INFO ] Deduced a trap composed of 38 places in 223 ms
[2021-05-13 12:14:52] [INFO ] Deduced a trap composed of 31 places in 250 ms
[2021-05-13 12:14:52] [INFO ] Deduced a trap composed of 16 places in 226 ms
[2021-05-13 12:14:52] [INFO ] Deduced a trap composed of 20 places in 225 ms
[2021-05-13 12:14:52] [INFO ] Deduced a trap composed of 32 places in 274 ms
[2021-05-13 12:14:53] [INFO ] Deduced a trap composed of 28 places in 211 ms
[2021-05-13 12:14:53] [INFO ] Deduced a trap composed of 19 places in 209 ms
[2021-05-13 12:14:53] [INFO ] Deduced a trap composed of 47 places in 127 ms
[2021-05-13 12:14:53] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2021-05-13 12:14:53] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2021-05-13 12:14:54] [INFO ] Deduced a trap composed of 34 places in 107 ms
[2021-05-13 12:14:54] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2021-05-13 12:14:54] [INFO ] Deduced a trap composed of 37 places in 110 ms
[2021-05-13 12:14:54] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 11795 ms
[2021-05-13 12:14:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:14:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 203 ms returned sat
[2021-05-13 12:14:54] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 65 ms returned sat
[2021-05-13 12:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:56] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2021-05-13 12:14:56] [INFO ] Deduced a trap composed of 19 places in 440 ms
[2021-05-13 12:14:57] [INFO ] Deduced a trap composed of 135 places in 662 ms
[2021-05-13 12:14:57] [INFO ] Deduced a trap composed of 8 places in 240 ms
[2021-05-13 12:14:58] [INFO ] Deduced a trap composed of 13 places in 663 ms
[2021-05-13 12:14:58] [INFO ] Deduced a trap composed of 18 places in 442 ms
[2021-05-13 12:14:59] [INFO ] Deduced a trap composed of 28 places in 345 ms
[2021-05-13 12:14:59] [INFO ] Deduced a trap composed of 12 places in 366 ms
[2021-05-13 12:15:00] [INFO ] Deduced a trap composed of 18 places in 777 ms
[2021-05-13 12:15:00] [INFO ] Deduced a trap composed of 24 places in 257 ms
[2021-05-13 12:15:01] [INFO ] Deduced a trap composed of 20 places in 503 ms
[2021-05-13 12:15:01] [INFO ] Deduced a trap composed of 16 places in 369 ms
[2021-05-13 12:15:01] [INFO ] Deduced a trap composed of 121 places in 456 ms
[2021-05-13 12:15:02] [INFO ] Deduced a trap composed of 36 places in 274 ms
[2021-05-13 12:15:02] [INFO ] Deduced a trap composed of 37 places in 280 ms
[2021-05-13 12:15:02] [INFO ] Deduced a trap composed of 25 places in 288 ms
[2021-05-13 12:15:03] [INFO ] Deduced a trap composed of 29 places in 270 ms
[2021-05-13 12:15:03] [INFO ] Deduced a trap composed of 18 places in 267 ms
[2021-05-13 12:15:03] [INFO ] Deduced a trap composed of 22 places in 284 ms
[2021-05-13 12:15:04] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2021-05-13 12:15:04] [INFO ] Deduced a trap composed of 126 places in 244 ms
[2021-05-13 12:15:04] [INFO ] Deduced a trap composed of 30 places in 246 ms
[2021-05-13 12:15:04] [INFO ] Deduced a trap composed of 31 places in 236 ms
[2021-05-13 12:15:05] [INFO ] Deduced a trap composed of 29 places in 135 ms
[2021-05-13 12:15:05] [INFO ] Deduced a trap composed of 27 places in 146 ms
[2021-05-13 12:15:05] [INFO ] Deduced a trap composed of 31 places in 163 ms
[2021-05-13 12:15:05] [INFO ] Deduced a trap composed of 38 places in 84 ms
[2021-05-13 12:15:05] [INFO ] Deduced a trap composed of 37 places in 97 ms
[2021-05-13 12:15:05] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9710 ms
[2021-05-13 12:15:05] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 52 ms.
[2021-05-13 12:15:10] [INFO ] Added : 406 causal constraints over 82 iterations in 5173 ms. Result :sat
[2021-05-13 12:15:11] [INFO ] [Real]Absence check using 78 positive place invariants in 72 ms returned sat
[2021-05-13 12:15:11] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2021-05-13 12:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:12] [INFO ] [Real]Absence check using state equation in 1315 ms returned sat
[2021-05-13 12:15:13] [INFO ] Deduced a trap composed of 19 places in 382 ms
[2021-05-13 12:15:13] [INFO ] Deduced a trap composed of 145 places in 348 ms
[2021-05-13 12:15:13] [INFO ] Deduced a trap composed of 22 places in 346 ms
[2021-05-13 12:15:14] [INFO ] Deduced a trap composed of 15 places in 338 ms
[2021-05-13 12:15:14] [INFO ] Deduced a trap composed of 25 places in 327 ms
[2021-05-13 12:15:14] [INFO ] Deduced a trap composed of 168 places in 348 ms
[2021-05-13 12:15:15] [INFO ] Deduced a trap composed of 21 places in 316 ms
[2021-05-13 12:15:15] [INFO ] Deduced a trap composed of 31 places in 311 ms
[2021-05-13 12:15:15] [INFO ] Deduced a trap composed of 25 places in 317 ms
[2021-05-13 12:15:16] [INFO ] Deduced a trap composed of 164 places in 329 ms
[2021-05-13 12:15:16] [INFO ] Deduced a trap composed of 28 places in 281 ms
[2021-05-13 12:15:16] [INFO ] Deduced a trap composed of 163 places in 279 ms
[2021-05-13 12:15:17] [INFO ] Deduced a trap composed of 31 places in 258 ms
[2021-05-13 12:15:17] [INFO ] Deduced a trap composed of 38 places in 256 ms
[2021-05-13 12:15:17] [INFO ] Deduced a trap composed of 153 places in 277 ms
[2021-05-13 12:15:18] [INFO ] Deduced a trap composed of 150 places in 274 ms
[2021-05-13 12:15:18] [INFO ] Deduced a trap composed of 160 places in 249 ms
[2021-05-13 12:15:18] [INFO ] Deduced a trap composed of 154 places in 283 ms
[2021-05-13 12:15:19] [INFO ] Deduced a trap composed of 42 places in 335 ms
[2021-05-13 12:15:19] [INFO ] Deduced a trap composed of 28 places in 339 ms
[2021-05-13 12:15:19] [INFO ] Deduced a trap composed of 30 places in 338 ms
[2021-05-13 12:15:20] [INFO ] Deduced a trap composed of 143 places in 329 ms
[2021-05-13 12:15:20] [INFO ] Deduced a trap composed of 152 places in 315 ms
[2021-05-13 12:15:20] [INFO ] Deduced a trap composed of 66 places in 291 ms
[2021-05-13 12:15:21] [INFO ] Deduced a trap composed of 148 places in 319 ms
[2021-05-13 12:15:21] [INFO ] Deduced a trap composed of 151 places in 290 ms
[2021-05-13 12:15:21] [INFO ] Deduced a trap composed of 158 places in 277 ms
[2021-05-13 12:15:22] [INFO ] Deduced a trap composed of 153 places in 276 ms
[2021-05-13 12:15:22] [INFO ] Deduced a trap composed of 153 places in 245 ms
[2021-05-13 12:15:22] [INFO ] Deduced a trap composed of 18 places in 239 ms
[2021-05-13 12:15:22] [INFO ] Deduced a trap composed of 153 places in 295 ms
[2021-05-13 12:15:23] [INFO ] Deduced a trap composed of 148 places in 239 ms
[2021-05-13 12:15:23] [INFO ] Deduced a trap composed of 148 places in 264 ms
[2021-05-13 12:15:23] [INFO ] Deduced a trap composed of 31 places in 251 ms
[2021-05-13 12:15:24] [INFO ] Deduced a trap composed of 23 places in 281 ms
[2021-05-13 12:15:24] [INFO ] Deduced a trap composed of 149 places in 271 ms
[2021-05-13 12:15:24] [INFO ] Deduced a trap composed of 33 places in 276 ms
[2021-05-13 12:15:25] [INFO ] Deduced a trap composed of 158 places in 288 ms
[2021-05-13 12:15:25] [INFO ] Deduced a trap composed of 158 places in 274 ms
[2021-05-13 12:15:25] [INFO ] Deduced a trap composed of 163 places in 253 ms
[2021-05-13 12:15:25] [INFO ] Deduced a trap composed of 30 places in 248 ms
[2021-05-13 12:15:26] [INFO ] Deduced a trap composed of 30 places in 286 ms
[2021-05-13 12:15:26] [INFO ] Deduced a trap composed of 153 places in 264 ms
[2021-05-13 12:15:26] [INFO ] Deduced a trap composed of 149 places in 274 ms
[2021-05-13 12:15:27] [INFO ] Deduced a trap composed of 149 places in 281 ms
[2021-05-13 12:15:27] [INFO ] Deduced a trap composed of 176 places in 269 ms
[2021-05-13 12:15:27] [INFO ] Deduced a trap composed of 47 places in 250 ms
[2021-05-13 12:15:28] [INFO ] Deduced a trap composed of 162 places in 297 ms
[2021-05-13 12:15:28] [INFO ] Deduced a trap composed of 159 places in 272 ms
[2021-05-13 12:15:28] [INFO ] Deduced a trap composed of 173 places in 267 ms
[2021-05-13 12:15:29] [INFO ] Deduced a trap composed of 32 places in 295 ms
[2021-05-13 12:15:29] [INFO ] Deduced a trap composed of 142 places in 281 ms
[2021-05-13 12:15:29] [INFO ] Deduced a trap composed of 31 places in 259 ms
[2021-05-13 12:15:29] [INFO ] Deduced a trap composed of 152 places in 260 ms
[2021-05-13 12:15:30] [INFO ] Deduced a trap composed of 154 places in 242 ms
[2021-05-13 12:15:30] [INFO ] Deduced a trap composed of 148 places in 252 ms
[2021-05-13 12:15:30] [INFO ] Deduced a trap composed of 165 places in 259 ms
[2021-05-13 12:15:31] [INFO ] Deduced a trap composed of 172 places in 254 ms
[2021-05-13 12:15:31] [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 s71 s77 s83 s89 s93 s111 s122 s123 s195 s196 s200 s201 s202 s220 s221 s231 s232 s233 s249 s250 s251 s274 s275 s276 s282 s283 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s335 s337 s350 s352 s360 s361 s362 s385 s386 s387 s399 s401 s402 s403 s406 s428 s433 s438 s453 s458 s462 s463 s464 s468 s473 s483 s488 s493 s498 s503 s508 s513 s523 s527 s530 s531 s532 s533 s534 s535 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s555 s556 s557 s560 s561 s562 s566 s567 s568 s569 s570 s589 s590 s591 s592 s593 s594 s595 s596 s599 s600 s603 s604 s605 s606 s607 s610 s611 s625 s626 s629 s630 s631 s632 s639 s640 s641 s642 s649 s650 s651 s652 s653 s654 s659 s660 s661 s662 s665 s666 s667 s670 s671 s676 s677 s684 s698 s704 s705 s706 s716 s717 s718) 0)") while checking expression at index 2
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 78 positive place invariants in 54 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 25 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2021-05-13 12:15:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:15:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 154 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 37 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:33] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2021-05-13 12:15:34] [INFO ] Deduced a trap composed of 8 places in 369 ms
[2021-05-13 12:15:34] [INFO ] Deduced a trap composed of 12 places in 327 ms
[2021-05-13 12:15:34] [INFO ] Deduced a trap composed of 148 places in 286 ms
[2021-05-13 12:15:35] [INFO ] Deduced a trap composed of 8 places in 275 ms
[2021-05-13 12:15:35] [INFO ] Deduced a trap composed of 21 places in 271 ms
[2021-05-13 12:15:35] [INFO ] Deduced a trap composed of 16 places in 279 ms
[2021-05-13 12:15:36] [INFO ] Deduced a trap composed of 25 places in 309 ms
[2021-05-13 12:15:36] [INFO ] Deduced a trap composed of 31 places in 306 ms
[2021-05-13 12:15:36] [INFO ] Deduced a trap composed of 31 places in 274 ms
[2021-05-13 12:15:37] [INFO ] Deduced a trap composed of 24 places in 271 ms
[2021-05-13 12:15:37] [INFO ] Deduced a trap composed of 37 places in 305 ms
[2021-05-13 12:15:37] [INFO ] Deduced a trap composed of 29 places in 334 ms
[2021-05-13 12:15:38] [INFO ] Deduced a trap composed of 33 places in 277 ms
[2021-05-13 12:15:38] [INFO ] Deduced a trap composed of 26 places in 261 ms
[2021-05-13 12:15:38] [INFO ] Deduced a trap composed of 25 places in 260 ms
[2021-05-13 12:15:38] [INFO ] Deduced a trap composed of 26 places in 263 ms
[2021-05-13 12:15:39] [INFO ] Deduced a trap composed of 22 places in 266 ms
[2021-05-13 12:15:39] [INFO ] Deduced a trap composed of 46 places in 270 ms
[2021-05-13 12:15:39] [INFO ] Deduced a trap composed of 42 places in 270 ms
[2021-05-13 12:15:40] [INFO ] Deduced a trap composed of 35 places in 283 ms
[2021-05-13 12:15:40] [INFO ] Deduced a trap composed of 26 places in 302 ms
[2021-05-13 12:15:40] [INFO ] Deduced a trap composed of 131 places in 268 ms
[2021-05-13 12:15:41] [INFO ] Deduced a trap composed of 39 places in 267 ms
[2021-05-13 12:15:41] [INFO ] Deduced a trap composed of 20 places in 264 ms
[2021-05-13 12:15:41] [INFO ] Deduced a trap composed of 152 places in 293 ms
[2021-05-13 12:15:41] [INFO ] Deduced a trap composed of 41 places in 254 ms
[2021-05-13 12:15:42] [INFO ] Deduced a trap composed of 41 places in 272 ms
[2021-05-13 12:15:42] [INFO ] Deduced a trap composed of 133 places in 284 ms
[2021-05-13 12:15:42] [INFO ] Deduced a trap composed of 127 places in 305 ms
[2021-05-13 12:15:43] [INFO ] Deduced a trap composed of 37 places in 289 ms
[2021-05-13 12:15:43] [INFO ] Deduced a trap composed of 39 places in 284 ms
[2021-05-13 12:15:43] [INFO ] Deduced a trap composed of 43 places in 313 ms
[2021-05-13 12:15:44] [INFO ] Deduced a trap composed of 138 places in 339 ms
[2021-05-13 12:15:44] [INFO ] Deduced a trap composed of 40 places in 288 ms
[2021-05-13 12:15:44] [INFO ] Deduced a trap composed of 154 places in 267 ms
[2021-05-13 12:15:45] [INFO ] Deduced a trap composed of 39 places in 280 ms
[2021-05-13 12:15:45] [INFO ] Deduced a trap composed of 35 places in 309 ms
[2021-05-13 12:15:45] [INFO ] Deduced a trap composed of 139 places in 262 ms
[2021-05-13 12:15:46] [INFO ] Deduced a trap composed of 50 places in 286 ms
[2021-05-13 12:15:46] [INFO ] Deduced a trap composed of 55 places in 287 ms
[2021-05-13 12:15:46] [INFO ] Deduced a trap composed of 36 places in 316 ms
[2021-05-13 12:15:47] [INFO ] Deduced a trap composed of 138 places in 339 ms
[2021-05-13 12:15:47] [INFO ] Deduced a trap composed of 150 places in 311 ms
[2021-05-13 12:15:47] [INFO ] Deduced a trap composed of 136 places in 289 ms
[2021-05-13 12:15:48] [INFO ] Deduced a trap composed of 148 places in 272 ms
[2021-05-13 12:15:48] [INFO ] Deduced a trap composed of 155 places in 257 ms
[2021-05-13 12:15:48] [INFO ] Deduced a trap composed of 138 places in 254 ms
[2021-05-13 12:15:49] [INFO ] Deduced a trap composed of 137 places in 283 ms
[2021-05-13 12:15:49] [INFO ] Deduced a trap composed of 145 places in 288 ms
[2021-05-13 12:15:49] [INFO ] Deduced a trap composed of 147 places in 250 ms
[2021-05-13 12:15:49] [INFO ] Deduced a trap composed of 132 places in 263 ms
[2021-05-13 12:15:50] [INFO ] Deduced a trap composed of 150 places in 278 ms
[2021-05-13 12:15:50] [INFO ] Deduced a trap composed of 141 places in 287 ms
[2021-05-13 12:15:50] [INFO ] Deduced a trap composed of 51 places in 279 ms
[2021-05-13 12:15:51] [INFO ] Deduced a trap composed of 139 places in 321 ms
[2021-05-13 12:15:51] [INFO ] Deduced a trap composed of 154 places in 274 ms
[2021-05-13 12:15:52] [INFO ] Deduced a trap composed of 144 places in 637 ms
[2021-05-13 12:15:52] [INFO ] Deduced a trap composed of 144 places in 383 ms
[2021-05-13 12:15:52] [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 s40 s41 s42 s43 s48 s49 s56 s57 s58 s59 s62 s63 s64 s65 s127 s128 s129 s143 s144 s145 s146 s147 s148 s149 s150 s151 s155 s157 s158 s160 s161 s191 s192 s195 s196 s212 s213 s214 s243 s244 s245 s249 s250 s251 s259 s260 s263 s264 s282 s283 s290 s293 s355 s356 s357 s361 s370 s371 s372 s376 s380 s381 s382 s395 s397 s401 s406 s433 s438 s448 s458 s463 s473 s478 s483 s488 s493 s498 s503 s513 s523 s527 s528 s529 s530 s531 s532 s533 s534 s535 s539 s540 s541 s542 s543 s546 s547 s575 s576 s577 s578 s583 s584 s585 s586 s599 s600 s603 s604 s606 s607 s608 s609 s610 s611 s621 s622 s623 s624 s625 s626 s635 s636 s639 s640 s647 s648 s653 s654 s659 s660 s670 s671 s672 s673 s674 s675 s676 s677 s684 s716) 0)") while checking expression at index 3
[2021-05-13 12:15:53] [INFO ] [Real]Absence check using 78 positive place invariants in 483 ms returned sat
[2021-05-13 12:15:53] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 42 ms returned sat
[2021-05-13 12:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:55] [INFO ] [Real]Absence check using state equation in 1863 ms returned sat
[2021-05-13 12:15:55] [INFO ] Deduced a trap composed of 11 places in 401 ms
[2021-05-13 12:15:56] [INFO ] Deduced a trap composed of 139 places in 362 ms
[2021-05-13 12:15:56] [INFO ] Deduced a trap composed of 140 places in 344 ms
[2021-05-13 12:15:56] [INFO ] Deduced a trap composed of 17 places in 365 ms
[2021-05-13 12:15:57] [INFO ] Deduced a trap composed of 27 places in 381 ms
[2021-05-13 12:15:57] [INFO ] Deduced a trap composed of 18 places in 327 ms
[2021-05-13 12:15:57] [INFO ] Deduced a trap composed of 21 places in 323 ms
[2021-05-13 12:15:58] [INFO ] Deduced a trap composed of 12 places in 304 ms
[2021-05-13 12:15:58] [INFO ] Deduced a trap composed of 20 places in 298 ms
[2021-05-13 12:15:59] [INFO ] Deduced a trap composed of 137 places in 335 ms
[2021-05-13 12:15:59] [INFO ] Deduced a trap composed of 130 places in 315 ms
[2021-05-13 12:15:59] [INFO ] Deduced a trap composed of 22 places in 332 ms
[2021-05-13 12:16:00] [INFO ] Deduced a trap composed of 19 places in 295 ms
[2021-05-13 12:16:00] [INFO ] Deduced a trap composed of 131 places in 275 ms
[2021-05-13 12:16:00] [INFO ] Deduced a trap composed of 33 places in 271 ms
[2021-05-13 12:16:01] [INFO ] Deduced a trap composed of 26 places in 299 ms
[2021-05-13 12:16:01] [INFO ] Deduced a trap composed of 26 places in 313 ms
[2021-05-13 12:16:01] [INFO ] Deduced a trap composed of 125 places in 292 ms
[2021-05-13 12:16:02] [INFO ] Deduced a trap composed of 37 places in 261 ms
[2021-05-13 12:16:02] [INFO ] Deduced a trap composed of 28 places in 292 ms
[2021-05-13 12:16:02] [INFO ] Deduced a trap composed of 38 places in 277 ms
[2021-05-13 12:16:03] [INFO ] Deduced a trap composed of 130 places in 259 ms
[2021-05-13 12:16:03] [INFO ] Deduced a trap composed of 35 places in 871 ms
[2021-05-13 12:16:04] [INFO ] Deduced a trap composed of 40 places in 525 ms
[2021-05-13 12:16:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 9232 ms
[2021-05-13 12:16:04] [INFO ] [Real]Absence check using 78 positive place invariants in 102 ms returned sat
[2021-05-13 12:16:04] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 47 ms returned sat
[2021-05-13 12:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:06] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2021-05-13 12:16:06] [INFO ] Deduced a trap composed of 11 places in 412 ms
[2021-05-13 12:16:07] [INFO ] Deduced a trap composed of 22 places in 354 ms
[2021-05-13 12:16:07] [INFO ] Deduced a trap composed of 19 places in 311 ms
[2021-05-13 12:16:07] [INFO ] Deduced a trap composed of 20 places in 274 ms
[2021-05-13 12:16:08] [INFO ] Deduced a trap composed of 26 places in 483 ms
[2021-05-13 12:16:08] [INFO ] Deduced a trap composed of 22 places in 458 ms
[2021-05-13 12:16:09] [INFO ] Deduced a trap composed of 31 places in 270 ms
[2021-05-13 12:16:09] [INFO ] Deduced a trap composed of 147 places in 295 ms
[2021-05-13 12:16:09] [INFO ] Deduced a trap composed of 145 places in 374 ms
[2021-05-13 12:16:10] [INFO ] Deduced a trap composed of 22 places in 332 ms
[2021-05-13 12:16:10] [INFO ] Deduced a trap composed of 159 places in 370 ms
[2021-05-13 12:16:12] [INFO ] Deduced a trap composed of 27 places in 1403 ms
[2021-05-13 12:16:12] [INFO ] Deduced a trap composed of 33 places in 369 ms
[2021-05-13 12:16:13] [INFO ] Deduced a trap composed of 140 places in 453 ms
[2021-05-13 12:16:13] [INFO ] Deduced a trap composed of 36 places in 457 ms
[2021-05-13 12:16:14] [INFO ] Deduced a trap composed of 42 places in 764 ms
[2021-05-13 12:16:14] [INFO ] Deduced a trap composed of 156 places in 474 ms
[2021-05-13 12:16:15] [INFO ] Deduced a trap composed of 55 places in 440 ms
[2021-05-13 12:16:15] [INFO ] Deduced a trap composed of 159 places in 483 ms
[2021-05-13 12:16:16] [INFO ] Deduced a trap composed of 150 places in 332 ms
[2021-05-13 12:16:16] [INFO ] Deduced a trap composed of 30 places in 317 ms
[2021-05-13 12:16:16] [INFO ] Deduced a trap composed of 149 places in 329 ms
[2021-05-13 12:16:17] [INFO ] Deduced a trap composed of 135 places in 331 ms
[2021-05-13 12:16:17] [INFO ] Deduced a trap composed of 38 places in 304 ms
[2021-05-13 12:16:17] [INFO ] Deduced a trap composed of 169 places in 286 ms
[2021-05-13 12:16:18] [INFO ] Deduced a trap composed of 172 places in 320 ms
[2021-05-13 12:16:18] [INFO ] Deduced a trap composed of 193 places in 393 ms
[2021-05-13 12:16:19] [INFO ] Deduced a trap composed of 169 places in 310 ms
[2021-05-13 12:16:19] [INFO ] Deduced a trap composed of 179 places in 297 ms
[2021-05-13 12:16:19] [INFO ] Deduced a trap composed of 178 places in 294 ms
[2021-05-13 12:16:20] [INFO ] Deduced a trap composed of 167 places in 336 ms
[2021-05-13 12:16:20] [INFO ] Deduced a trap composed of 151 places in 304 ms
[2021-05-13 12:16:23] [INFO ] Deduced a trap composed of 150 places in 2885 ms
[2021-05-13 12:16:28] [INFO ] Deduced a trap composed of 169 places in 4552 ms
[2021-05-13 12:16:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s40 s41 s42 s43 s44 s45 s48 s49 s56 s57 s58 s59 s60 s61 s64 s65 s122 s123 s127 s128 s129 s133 s134 s135 s152 s153 s154 s159 s174 s212 s213 s214 s255 s256 s257 s274 s275 s276 s282 s283 s335 s336 s337 s365 s366 s367 s371 s375 s377 s395 s397 s406 s433 s448 s467 s469 s473 s478 s488 s493 s498 s507 s508 s509 s518 s523 s527 s530 s531 s532 s533 s534 s535 s536 s537 s539 s540 s541 s542 s543 s571 s572 s577 s578 s581 s582 s591 s592 s593 s594 s595 s596 s599 s600 s601 s602 s603 s604 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s619 s620 s621 s622 s623 s624 s625 s626 s633 s634 s635 s636 s639 s640 s643 s644 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s665 s666 s667 s668 s669 s670 s671 s682 s683 s684 s716) 0)") while checking expression at index 5
[2021-05-13 12:16:28] [INFO ] [Real]Absence check using 78 positive place invariants in 113 ms returned sat
[2021-05-13 12:16:28] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 222 ms returned sat
[2021-05-13 12:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:29] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2021-05-13 12:16:30] [INFO ] Deduced a trap composed of 13 places in 461 ms
[2021-05-13 12:16:30] [INFO ] Deduced a trap composed of 34 places in 334 ms
[2021-05-13 12:16:31] [INFO ] Deduced a trap composed of 16 places in 393 ms
[2021-05-13 12:16:31] [INFO ] Deduced a trap composed of 19 places in 347 ms
[2021-05-13 12:16:31] [INFO ] Deduced a trap composed of 24 places in 203 ms
[2021-05-13 12:16:32] [INFO ] Deduced a trap composed of 20 places in 209 ms
[2021-05-13 12:16:32] [INFO ] Deduced a trap composed of 20 places in 217 ms
[2021-05-13 12:16:32] [INFO ] Deduced a trap composed of 22 places in 228 ms
[2021-05-13 12:16:32] [INFO ] Deduced a trap composed of 27 places in 234 ms
[2021-05-13 12:16:33] [INFO ] Deduced a trap composed of 44 places in 222 ms
[2021-05-13 12:16:33] [INFO ] Deduced a trap composed of 22 places in 193 ms
[2021-05-13 12:16:33] [INFO ] Deduced a trap composed of 32 places in 207 ms
[2021-05-13 12:16:33] [INFO ] Deduced a trap composed of 65 places in 230 ms
[2021-05-13 12:16:34] [INFO ] Deduced a trap composed of 62 places in 194 ms
[2021-05-13 12:16:34] [INFO ] Deduced a trap composed of 59 places in 199 ms
[2021-05-13 12:16:34] [INFO ] Deduced a trap composed of 59 places in 189 ms
[2021-05-13 12:16:34] [INFO ] Deduced a trap composed of 63 places in 356 ms
[2021-05-13 12:16:35] [INFO ] Deduced a trap composed of 29 places in 294 ms
[2021-05-13 12:16:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5321 ms
[2021-05-13 12:16:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:16:35] [INFO ] [Nat]Absence check using 78 positive place invariants in 210 ms returned sat
[2021-05-13 12:16:35] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 61 ms returned sat
[2021-05-13 12:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:39] [INFO ] [Nat]Absence check using state equation in 3444 ms returned sat
[2021-05-13 12:16:39] [INFO ] Deduced a trap composed of 16 places in 407 ms
[2021-05-13 12:16:40] [INFO ] Deduced a trap composed of 18 places in 362 ms
[2021-05-13 12:16:40] [INFO ] Deduced a trap composed of 17 places in 330 ms
[2021-05-13 12:16:41] [INFO ] Deduced a trap composed of 13 places in 537 ms
[2021-05-13 12:16:43] [INFO ] Deduced a trap composed of 21 places in 2715 ms
[2021-05-13 12:16:44] [INFO ] Deduced a trap composed of 25 places in 772 ms
[2021-05-13 12:16:45] [INFO ] Deduced a trap composed of 24 places in 543 ms
[2021-05-13 12:16:45] [INFO ] Deduced a trap composed of 30 places in 324 ms
[2021-05-13 12:16:45] [INFO ] Deduced a trap composed of 39 places in 321 ms
[2021-05-13 12:16:46] [INFO ] Deduced a trap composed of 29 places in 275 ms
[2021-05-13 12:16:46] [INFO ] Deduced a trap composed of 27 places in 259 ms
[2021-05-13 12:16:46] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2021-05-13 12:16:47] [INFO ] Deduced a trap composed of 18 places in 274 ms
[2021-05-13 12:16:47] [INFO ] Deduced a trap composed of 24 places in 261 ms
[2021-05-13 12:16:47] [INFO ] Deduced a trap composed of 27 places in 309 ms
[2021-05-13 12:16:48] [INFO ] Deduced a trap composed of 65 places in 399 ms
[2021-05-13 12:16:48] [INFO ] Deduced a trap composed of 18 places in 457 ms
[2021-05-13 12:16:49] [INFO ] Deduced a trap composed of 68 places in 463 ms
[2021-05-13 12:16:49] [INFO ] Deduced a trap composed of 31 places in 293 ms
[2021-05-13 12:16:50] [INFO ] Deduced a trap composed of 42 places in 578 ms
[2021-05-13 12:16:50] [INFO ] Deduced a trap composed of 46 places in 302 ms
[2021-05-13 12:16:50] [INFO ] Deduced a trap composed of 44 places in 307 ms
[2021-05-13 12:16:51] [INFO ] Deduced a trap composed of 34 places in 326 ms
[2021-05-13 12:16:51] [INFO ] Deduced a trap composed of 29 places in 100 ms
[2021-05-13 12:16:51] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 11967 ms
[2021-05-13 12:16:51] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 73 ms.
[2021-05-13 12:16:55] [INFO ] Added : 335 causal constraints over 67 iterations in 4082 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 12:16:55] [INFO ] [Real]Absence check using 78 positive place invariants in 232 ms returned sat
[2021-05-13 12:16:55] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 28 ms returned sat
[2021-05-13 12:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:56] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2021-05-13 12:16:57] [INFO ] Deduced a trap composed of 11 places in 456 ms
[2021-05-13 12:16:57] [INFO ] Deduced a trap composed of 133 places in 402 ms
[2021-05-13 12:16:59] [INFO ] Deduced a trap composed of 19 places in 1948 ms
[2021-05-13 12:17:00] [INFO ] Deduced a trap composed of 141 places in 329 ms
[2021-05-13 12:17:00] [INFO ] Deduced a trap composed of 23 places in 323 ms
[2021-05-13 12:17:01] [INFO ] Deduced a trap composed of 8 places in 487 ms
[2021-05-13 12:17:01] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2021-05-13 12:17:01] [INFO ] Deduced a trap composed of 23 places in 292 ms
[2021-05-13 12:17:02] [INFO ] Deduced a trap composed of 25 places in 1107 ms
[2021-05-13 12:17:03] [INFO ] Deduced a trap composed of 33 places in 156 ms
[2021-05-13 12:17:03] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2021-05-13 12:17:03] [INFO ] Deduced a trap composed of 35 places in 165 ms
[2021-05-13 12:17:03] [INFO ] Deduced a trap composed of 32 places in 138 ms
[2021-05-13 12:17:04] [INFO ] Deduced a trap composed of 30 places in 183 ms
[2021-05-13 12:17:04] [INFO ] Deduced a trap composed of 31 places in 187 ms
[2021-05-13 12:17:09] [INFO ] Deduced a trap composed of 40 places in 5070 ms
[2021-05-13 12:17:09] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2021-05-13 12:17:09] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2021-05-13 12:17:11] [INFO ] Deduced a trap composed of 66 places in 1494 ms
[2021-05-13 12:17:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 14237 ms
[2021-05-13 12:17:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:17:12] [INFO ] [Nat]Absence check using 78 positive place invariants in 592 ms returned sat
[2021-05-13 12:17:12] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 173 ms returned sat
[2021-05-13 12:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:15] [INFO ] [Nat]Absence check using state equation in 2850 ms returned sat
[2021-05-13 12:17:15] [INFO ] Deduced a trap composed of 8 places in 340 ms
[2021-05-13 12:17:15] [INFO ] Deduced a trap composed of 128 places in 313 ms
[2021-05-13 12:17:16] [INFO ] Deduced a trap composed of 11 places in 336 ms
[2021-05-13 12:17:16] [INFO ] Deduced a trap composed of 17 places in 482 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 29 places in 1380 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 39 places in 152 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2021-05-13 12:17:18] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2021-05-13 12:17:19] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2021-05-13 12:17:19] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2021-05-13 12:17:19] [INFO ] Deduced a trap composed of 33 places in 235 ms
[2021-05-13 12:17:19] [INFO ] Deduced a trap composed of 33 places in 231 ms
[2021-05-13 12:17:20] [INFO ] Deduced a trap composed of 36 places in 202 ms
[2021-05-13 12:17:20] [INFO ] Deduced a trap composed of 35 places in 200 ms
[2021-05-13 12:17:20] [INFO ] Deduced a trap composed of 33 places in 207 ms
[2021-05-13 12:17:20] [INFO ] Deduced a trap composed of 33 places in 152 ms
[2021-05-13 12:17:20] [INFO ] Deduced a trap composed of 37 places in 103 ms
[2021-05-13 12:17:21] [INFO ] Deduced a trap composed of 65 places in 87 ms
[2021-05-13 12:17:21] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5976 ms
[2021-05-13 12:17:21] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 52 ms.
[2021-05-13 12:17:25] [INFO ] Added : 435 causal constraints over 88 iterations in 4657 ms. Result :sat
[2021-05-13 12:17:25] [INFO ] [Real]Absence check using 78 positive place invariants in 70 ms returned sat
[2021-05-13 12:17:25] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 34 ms returned sat
[2021-05-13 12:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:27] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2021-05-13 12:17:27] [INFO ] Deduced a trap composed of 8 places in 467 ms
[2021-05-13 12:17:27] [INFO ] Deduced a trap composed of 15 places in 274 ms
[2021-05-13 12:17:28] [INFO ] Deduced a trap composed of 8 places in 273 ms
[2021-05-13 12:17:28] [INFO ] Deduced a trap composed of 11 places in 249 ms
[2021-05-13 12:17:28] [INFO ] Deduced a trap composed of 16 places in 240 ms
[2021-05-13 12:17:29] [INFO ] Deduced a trap composed of 19 places in 251 ms
[2021-05-13 12:17:29] [INFO ] Deduced a trap composed of 22 places in 222 ms
[2021-05-13 12:17:29] [INFO ] Deduced a trap composed of 131 places in 289 ms
[2021-05-13 12:17:30] [INFO ] Deduced a trap composed of 22 places in 337 ms
[2021-05-13 12:17:30] [INFO ] Deduced a trap composed of 129 places in 295 ms
[2021-05-13 12:17:30] [INFO ] Deduced a trap composed of 23 places in 284 ms
[2021-05-13 12:17:30] [INFO ] Deduced a trap composed of 25 places in 293 ms
[2021-05-13 12:17:31] [INFO ] Deduced a trap composed of 16 places in 478 ms
[2021-05-13 12:17:32] [INFO ] Deduced a trap composed of 20 places in 690 ms
[2021-05-13 12:17:32] [INFO ] Deduced a trap composed of 18 places in 383 ms
[2021-05-13 12:17:33] [INFO ] Deduced a trap composed of 35 places in 301 ms
[2021-05-13 12:17:33] [INFO ] Deduced a trap composed of 124 places in 294 ms
[2021-05-13 12:17:33] [INFO ] Deduced a trap composed of 124 places in 334 ms
[2021-05-13 12:17:34] [INFO ] Deduced a trap composed of 21 places in 302 ms
[2021-05-13 12:17:34] [INFO ] Deduced a trap composed of 27 places in 265 ms
[2021-05-13 12:17:34] [INFO ] Deduced a trap composed of 19 places in 266 ms
[2021-05-13 12:17:34] [INFO ] Deduced a trap composed of 15 places in 239 ms
[2021-05-13 12:17:35] [INFO ] Deduced a trap composed of 128 places in 245 ms
[2021-05-13 12:17:35] [INFO ] Deduced a trap composed of 26 places in 244 ms
[2021-05-13 12:17:35] [INFO ] Deduced a trap composed of 32 places in 149 ms
[2021-05-13 12:17:35] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2021-05-13 12:17:35] [INFO ] Deduced a trap composed of 25 places in 119 ms
[2021-05-13 12:17:36] [INFO ] Deduced a trap composed of 36 places in 116 ms
[2021-05-13 12:17:36] [INFO ] Deduced a trap composed of 38 places in 140 ms
[2021-05-13 12:17:36] [INFO ] Deduced a trap composed of 49 places in 237 ms
[2021-05-13 12:17:37] [INFO ] Deduced a trap composed of 52 places in 479 ms
[2021-05-13 12:17:37] [INFO ] Deduced a trap composed of 57 places in 136 ms
[2021-05-13 12:17:37] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 10080 ms
[2021-05-13 12:17:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:17:37] [INFO ] [Nat]Absence check using 78 positive place invariants in 263 ms returned sat
[2021-05-13 12:17:37] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 57 ms returned sat
[2021-05-13 12:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:38] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
[2021-05-13 12:17:39] [INFO ] Deduced a trap composed of 8 places in 624 ms
[2021-05-13 12:17:40] [INFO ] Deduced a trap composed of 21 places in 481 ms
[2021-05-13 12:17:40] [INFO ] Deduced a trap composed of 11 places in 427 ms
[2021-05-13 12:17:41] [INFO ] Deduced a trap composed of 19 places in 417 ms
[2021-05-13 12:17:41] [INFO ] Deduced a trap composed of 24 places in 425 ms
[2021-05-13 12:17:41] [INFO ] Deduced a trap composed of 131 places in 450 ms
[2021-05-13 12:17:42] [INFO ] Deduced a trap composed of 127 places in 428 ms
[2021-05-13 12:17:42] [INFO ] Deduced a trap composed of 27 places in 341 ms
[2021-05-13 12:17:43] [INFO ] Deduced a trap composed of 34 places in 328 ms
[2021-05-13 12:17:43] [INFO ] Deduced a trap composed of 22 places in 324 ms
[2021-05-13 12:17:43] [INFO ] Deduced a trap composed of 32 places in 348 ms
[2021-05-13 12:17:44] [INFO ] Deduced a trap composed of 31 places in 330 ms
[2021-05-13 12:17:44] [INFO ] Deduced a trap composed of 25 places in 299 ms
[2021-05-13 12:17:44] [INFO ] Deduced a trap composed of 42 places in 315 ms
[2021-05-13 12:17:45] [INFO ] Deduced a trap composed of 133 places in 333 ms
[2021-05-13 12:17:45] [INFO ] Deduced a trap composed of 132 places in 284 ms
[2021-05-13 12:17:46] [INFO ] Deduced a trap composed of 135 places in 314 ms
[2021-05-13 12:17:46] [INFO ] Deduced a trap composed of 138 places in 337 ms
[2021-05-13 12:17:46] [INFO ] Deduced a trap composed of 40 places in 330 ms
[2021-05-13 12:17:47] [INFO ] Deduced a trap composed of 27 places in 309 ms
[2021-05-13 12:17:47] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8248 ms
[2021-05-13 12:17:47] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 57 ms.
[2021-05-13 12:17:53] [INFO ] Added : 447 causal constraints over 90 iterations in 6744 ms. Result :sat
[2021-05-13 12:17:54] [INFO ] Deduced a trap composed of 161 places in 643 ms
[2021-05-13 12:17:55] [INFO ] Deduced a trap composed of 158 places in 312 ms
[2021-05-13 12:17:55] [INFO ] Deduced a trap composed of 159 places in 355 ms
[2021-05-13 12:17:56] [INFO ] Deduced a trap composed of 158 places in 589 ms
[2021-05-13 12:17:56] [INFO ] Deduced a trap composed of 158 places in 503 ms
[2021-05-13 12:17:57] [INFO ] Deduced a trap composed of 164 places in 314 ms
[2021-05-13 12:17:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s69 s70 s71 s72 s73 s75 s78 s79 s80 s81 s82 s83 s84 s85 s86 s96 s97 s98 s102 s103 s104 s105 s165 s166 s167 s187 s188 s189 s220 s221 s249 s250 s251 s265 s268 s269 s270 s336 s356 s365 s367 s376 s381 s396 s401 s405 s407 s411 s428 s432 s433 s434 s442 s443 s444 s452 s454 s458 s462 s464 s468 s472 s473 s474 s477 s479 s488 s493 s498 s503 s508 s518 s527 s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s544 s545 s548 s549 s550 s551 s558 s559 s569 s570 s573 s574 s575 s576 s579 s580 s583 s584 s585 s586 s587 s588 s591 s592 s595 s596 s608 s609 s616 s617 s618 s619 s620 s625 s626 s631 s632 s633 s634 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s651 s652 s659 s660 s661 s662 s665 s666 s667 s668 s669 s674 s675 s678 s679 s680 s681 s684 s707 s708 s709) 0)") while checking expression at index 8
[2021-05-13 12:17:57] [INFO ] [Real]Absence check using 78 positive place invariants in 70 ms returned sat
[2021-05-13 12:17:57] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2021-05-13 12:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:58] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2021-05-13 12:17:59] [INFO ] Deduced a trap composed of 19 places in 344 ms
[2021-05-13 12:17:59] [INFO ] Deduced a trap composed of 8 places in 321 ms
[2021-05-13 12:17:59] [INFO ] Deduced a trap composed of 14 places in 306 ms
[2021-05-13 12:18:00] [INFO ] Deduced a trap composed of 27 places in 303 ms
[2021-05-13 12:18:00] [INFO ] Deduced a trap composed of 18 places in 301 ms
[2021-05-13 12:18:00] [INFO ] Deduced a trap composed of 21 places in 314 ms
[2021-05-13 12:18:01] [INFO ] Deduced a trap composed of 21 places in 288 ms
[2021-05-13 12:18:01] [INFO ] Deduced a trap composed of 33 places in 320 ms
[2021-05-13 12:18:01] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2021-05-13 12:18:02] [INFO ] Deduced a trap composed of 34 places in 269 ms
[2021-05-13 12:18:02] [INFO ] Deduced a trap composed of 30 places in 273 ms
[2021-05-13 12:18:02] [INFO ] Deduced a trap composed of 156 places in 277 ms
[2021-05-13 12:18:02] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2021-05-13 12:18:03] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2021-05-13 12:18:03] [INFO ] Deduced a trap composed of 31 places in 141 ms
[2021-05-13 12:18:03] [INFO ] Deduced a trap composed of 35 places in 158 ms
[2021-05-13 12:18:03] [INFO ] Deduced a trap composed of 56 places in 156 ms
[2021-05-13 12:18:03] [INFO ] Deduced a trap composed of 38 places in 133 ms
[2021-05-13 12:18:07] [INFO ] Deduced a trap composed of 42 places in 3966 ms
[2021-05-13 12:18:08] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2021-05-13 12:18:08] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2021-05-13 12:18:08] [INFO ] Deduced a trap composed of 79 places in 88 ms
[2021-05-13 12:18:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9545 ms
[2021-05-13 12:18:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:18:08] [INFO ] [Nat]Absence check using 78 positive place invariants in 211 ms returned sat
[2021-05-13 12:18:08] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 34 ms returned sat
[2021-05-13 12:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:10] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2021-05-13 12:18:10] [INFO ] Deduced a trap composed of 23 places in 479 ms
[2021-05-13 12:18:11] [INFO ] Deduced a trap composed of 15 places in 488 ms
[2021-05-13 12:18:11] [INFO ] Deduced a trap composed of 22 places in 476 ms
[2021-05-13 12:18:11] [INFO ] Deduced a trap composed of 149 places in 348 ms
[2021-05-13 12:18:12] [INFO ] Deduced a trap composed of 20 places in 232 ms
[2021-05-13 12:18:12] [INFO ] Deduced a trap composed of 22 places in 234 ms
[2021-05-13 12:18:12] [INFO ] Deduced a trap composed of 30 places in 200 ms
[2021-05-13 12:18:12] [INFO ] Deduced a trap composed of 37 places in 220 ms
[2021-05-13 12:18:13] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2021-05-13 12:18:13] [INFO ] Deduced a trap composed of 26 places in 206 ms
[2021-05-13 12:18:13] [INFO ] Deduced a trap composed of 160 places in 471 ms
[2021-05-13 12:18:14] [INFO ] Deduced a trap composed of 36 places in 219 ms
[2021-05-13 12:18:14] [INFO ] Deduced a trap composed of 35 places in 189 ms
[2021-05-13 12:18:14] [INFO ] Deduced a trap composed of 43 places in 192 ms
[2021-05-13 12:18:14] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2021-05-13 12:18:15] [INFO ] Deduced a trap composed of 160 places in 430 ms
[2021-05-13 12:18:15] [INFO ] Deduced a trap composed of 153 places in 434 ms
[2021-05-13 12:18:16] [INFO ] Deduced a trap composed of 50 places in 421 ms
[2021-05-13 12:18:16] [INFO ] Deduced a trap composed of 25 places in 448 ms
[2021-05-13 12:18:17] [INFO ] Deduced a trap composed of 33 places in 341 ms
[2021-05-13 12:18:17] [INFO ] Deduced a trap composed of 161 places in 337 ms
[2021-05-13 12:18:17] [INFO ] Deduced a trap composed of 163 places in 299 ms
[2021-05-13 12:18:18] [INFO ] Deduced a trap composed of 164 places in 287 ms
[2021-05-13 12:18:18] [INFO ] Deduced a trap composed of 171 places in 274 ms
[2021-05-13 12:18:18] [INFO ] Deduced a trap composed of 170 places in 363 ms
[2021-05-13 12:18:19] [INFO ] Deduced a trap composed of 53 places in 273 ms
[2021-05-13 12:18:19] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2021-05-13 12:18:19] [INFO ] Deduced a trap composed of 162 places in 313 ms
[2021-05-13 12:18:19] [INFO ] Deduced a trap composed of 175 places in 391 ms
[2021-05-13 12:18:20] [INFO ] Deduced a trap composed of 64 places in 68 ms
[2021-05-13 12:18:20] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 10053 ms
[2021-05-13 12:18:20] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 23 ms.
[2021-05-13 12:18:27] [INFO ] Added : 499 causal constraints over 101 iterations in 7859 ms. Result :sat
[2021-05-13 12:18:28] [INFO ] Deduced a trap composed of 156 places in 596 ms
[2021-05-13 12:18:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s69 s71 s73 s77 s78 s79 s80 s84 s85 s86 s89 s93 s102 s111 s143 s144 s145 s171 s172 s173 s195 s196 s200 s201 s202 s220 s221 s243 s244 s245 s249 s250 s251 s255 s256 s257 s259 s260 s263 s264 s277 s280 s281 s351 s366 s371 s375 s376 s377 s386 s401 s406 s427 s429 s438 s443 s453 s458 s463 s468 s478 s483 s493 s498 s503 s508 s513 s527 s528 s529 s530 s531 s532 s533 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s556 s557 s565 s569 s570 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s593 s594 s595 s596 s597 s598 s599 s600 s606 s607 s610 s611 s612 s613 s616 s625 s626 s627 s628 s629 s630 s637 s638 s639 s640 s643 s644 s647 s648 s653 s654 s670 s671 s674 s675 s676 s677 s680 s681 s684 s704 s705 s706 s713) 0)") while checking expression at index 9
[2021-05-13 12:18:28] [INFO ] [Real]Absence check using 78 positive place invariants in 140 ms returned sat
[2021-05-13 12:18:28] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 62 ms returned sat
[2021-05-13 12:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:31] [INFO ] [Real]Absence check using state equation in 2163 ms returned sat
[2021-05-13 12:18:31] [INFO ] Deduced a trap composed of 19 places in 503 ms
[2021-05-13 12:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 554 ms
[2021-05-13 12:18:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:18:31] [INFO ] [Nat]Absence check using 78 positive place invariants in 138 ms returned sat
[2021-05-13 12:18:32] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 53 ms returned sat
[2021-05-13 12:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:33] [INFO ] [Nat]Absence check using state equation in 1588 ms returned sat
[2021-05-13 12:18:34] [INFO ] Deduced a trap composed of 19 places in 378 ms
[2021-05-13 12:18:34] [INFO ] Deduced a trap composed of 8 places in 346 ms
[2021-05-13 12:18:34] [INFO ] Deduced a trap composed of 14 places in 298 ms
[2021-05-13 12:18:35] [INFO ] Deduced a trap composed of 17 places in 356 ms
[2021-05-13 12:18:35] [INFO ] Deduced a trap composed of 28 places in 235 ms
[2021-05-13 12:18:35] [INFO ] Deduced a trap composed of 24 places in 193 ms
[2021-05-13 12:18:35] [INFO ] Deduced a trap composed of 32 places in 213 ms
[2021-05-13 12:18:36] [INFO ] Deduced a trap composed of 22 places in 221 ms
[2021-05-13 12:18:36] [INFO ] Deduced a trap composed of 25 places in 224 ms
[2021-05-13 12:18:36] [INFO ] Deduced a trap composed of 25 places in 486 ms
[2021-05-13 12:18:37] [INFO ] Deduced a trap composed of 33 places in 193 ms
[2021-05-13 12:18:37] [INFO ] Deduced a trap composed of 37 places in 145 ms
[2021-05-13 12:18:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3808 ms
[2021-05-13 12:18:37] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 41 ms.
[2021-05-13 12:18:44] [INFO ] Added : 357 causal constraints over 73 iterations in 6647 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 12:18:44] [INFO ] Flatten gal took : 205 ms
[2021-05-13 12:18:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 12:18:44] [INFO ] Flatten gal took : 48 ms
FORMULA BusinessProcesses-PT-20-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:18:44] [INFO ] Applying decomposition
[2021-05-13 12:18:44] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7618907099788695668.txt, -o, /tmp/graph7618907099788695668.bin, -w, /tmp/graph7618907099788695668.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/graph7618907099788695668.bin, -l, -1, -v, -w, /tmp/graph7618907099788695668.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 12:18:45] [INFO ] Decomposing Gal with order
[2021-05-13 12:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:18:45] [INFO ] Removed a total of 286 redundant transitions.
[2021-05-13 12:18:45] [INFO ] Flatten gal took : 225 ms
[2021-05-13 12:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 18 ms.
[2021-05-13 12:18:45] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 14 ms
[2021-05-13 12:18:45] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 66 ordering constraints for composite.
built 6 ordering constraints for composite.
built 28 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 40 ordering constraints for composite.
built 22 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 37 ordering constraints for composite.
built 23 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 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 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 86 ordering constraints for composite.
built 21 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 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 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 25 ordering constraints for composite.
built 40 ordering constraints for composite.
built 42 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
Detected timeout of ITS tools.
[2021-05-13 12:40:10] [INFO ] Applying decomposition
[2021-05-13 12:40:10] [INFO ] Flatten gal took : 703 ms
[2021-05-13 12:40:11] [INFO ] Decomposing Gal with order
[2021-05-13 12:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:40:11] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-13 12:40:12] [INFO ] Flatten gal took : 760 ms
[2021-05-13 12:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 493 ms.
[2021-05-13 12:40:14] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 40 ms
[2021-05-13 12:40:14] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 2 ordering constraints for composite.
built 155 ordering constraints for composite.
built 86 ordering constraints for composite.
built 85 ordering constraints for composite.
built 84 ordering constraints for composite.
built 84 ordering constraints for composite.
built 84 ordering constraints for composite.
built 81 ordering constraints for composite.
built 79 ordering constraints for composite.
built 77 ordering constraints for composite.
built 74 ordering constraints for composite.
built 72 ordering constraints for composite.
built 70 ordering constraints for composite.
built 68 ordering constraints for composite.
built 66 ordering constraints for composite.
built 64 ordering constraints for composite.
built 62 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 34 ordering constraints for composite.
built 34 ordering constraints for composite.
built 34 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 27 ordering constraints for composite.
built 10 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 71 ordering constraints for composite.
built 69 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 92 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2021-05-13 13:01:38] [INFO ] Flatten gal took : 540 ms
[2021-05-13 13:01:40] [INFO ] Input system was already deterministic with 638 transitions.
[2021-05-13 13:01:40] [INFO ] Transformed 719 places.
[2021-05-13 13:01:40] [INFO ] Transformed 638 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
[2021-05-13 13:02:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2021-05-13 13:02:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 29 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167800120"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;