Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100602.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.7K 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 192K 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-20-00
FORMULA_NAME BusinessProcesses-PT-20-01
FORMULA_NAME BusinessProcesses-PT-20-02
FORMULA_NAME BusinessProcesses-PT-20-03
FORMULA_NAME BusinessProcesses-PT-20-04
FORMULA_NAME BusinessProcesses-PT-20-05
FORMULA_NAME BusinessProcesses-PT-20-06
FORMULA_NAME BusinessProcesses-PT-20-07
FORMULA_NAME BusinessProcesses-PT-20-08
FORMULA_NAME BusinessProcesses-PT-20-09
FORMULA_NAME BusinessProcesses-PT-20-10
FORMULA_NAME BusinessProcesses-PT-20-11
FORMULA_NAME BusinessProcesses-PT-20-12
FORMULA_NAME BusinessProcesses-PT-20-13
FORMULA_NAME BusinessProcesses-PT-20-14
FORMULA_NAME BusinessProcesses-PT-20-15

=== Now, execution of the tool begins

BK_START 1591167635474

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:00:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 07:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:00:37] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 07:00:37] [INFO ] Transformed 782 places.
[2020-06-03 07:00:37] [INFO ] Transformed 697 transitions.
[2020-06-03 07:00:37] [INFO ] Found NUPN structural information;
[2020-06-03 07:00:37] [INFO ] Parsed PT model containing 782 places and 697 transitions in 119 ms.
Deduced a syphon composed of 63 places in 9 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 508 resets, run finished after 241 ms. (steps per millisecond=414 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 638 rows 719 cols
[2020-06-03 07:00:37] [INFO ] Computed 121 place invariants in 26 ms
[2020-06-03 07:00:38] [INFO ] [Real]Absence check using 78 positive place invariants in 56 ms returned sat
[2020-06-03 07:00:38] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 07:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:00:39] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2020-06-03 07:00:39] [INFO ] Deduced a trap composed of 19 places in 340 ms
[2020-06-03 07:00:39] [INFO ] Deduced a trap composed of 22 places in 294 ms
[2020-06-03 07:00:40] [INFO ] Deduced a trap composed of 19 places in 222 ms
[2020-06-03 07:00:40] [INFO ] Deduced a trap composed of 22 places in 508 ms
[2020-06-03 07:00:40] [INFO ] Deduced a trap composed of 11 places in 268 ms
[2020-06-03 07:00:41] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-06-03 07:00:41] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2020-06-03 07:00:41] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 07:00:41] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-06-03 07:00:41] [INFO ] Deduced a trap composed of 28 places in 146 ms
[2020-06-03 07:00:42] [INFO ] Deduced a trap composed of 60 places in 147 ms
[2020-06-03 07:00:42] [INFO ] Deduced a trap composed of 65 places in 162 ms
[2020-06-03 07:00:42] [INFO ] Deduced a trap composed of 54 places in 151 ms
[2020-06-03 07:00:42] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-06-03 07:00:42] [INFO ] Deduced a trap composed of 53 places in 135 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 19 places in 136 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 48 places in 133 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 32 places in 119 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 58 places in 133 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 57 places in 123 ms
[2020-06-03 07:00:43] [INFO ] Deduced a trap composed of 59 places in 123 ms
[2020-06-03 07:00:44] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-06-03 07:00:44] [INFO ] Deduced a trap composed of 52 places in 146 ms
[2020-06-03 07:00:44] [INFO ] Deduced a trap composed of 59 places in 154 ms
[2020-06-03 07:00:44] [INFO ] Deduced a trap composed of 56 places in 128 ms
[2020-06-03 07:00:44] [INFO ] Deduced a trap composed of 30 places in 143 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 67 places in 155 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 28 places in 171 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 26 places in 161 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 28 places in 168 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 76 places in 152 ms
[2020-06-03 07:00:45] [INFO ] Deduced a trap composed of 63 places in 116 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 66 places in 126 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 63 places in 127 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 59 places in 106 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 69 places in 108 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 87 places in 114 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 65 places in 108 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 82 places in 120 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 79 places in 106 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 75 places in 104 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 64 places in 113 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 72 places in 111 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 62 places in 144 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 62 places in 102 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 59 places in 113 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 64 places in 108 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 61 places in 98 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 66 places in 96 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 12 places in 194 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 20 places in 146 ms
[2020-06-03 07:00:48] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 9664 ms
[2020-06-03 07:00:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:00:49] [INFO ] [Nat]Absence check using 78 positive place invariants in 221 ms returned sat
[2020-06-03 07:00:49] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 37 ms returned sat
[2020-06-03 07:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:00:50] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2020-06-03 07:00:53] [INFO ] Deduced a trap composed of 19 places in 3206 ms
[2020-06-03 07:00:57] [INFO ] Deduced a trap composed of 22 places in 4499 ms
[2020-06-03 07:00:59] [INFO ] Deduced a trap composed of 11 places in 1625 ms
[2020-06-03 07:00:59] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-06-03 07:00:59] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-06-03 07:01:00] [INFO ] Deduced a trap composed of 23 places in 157 ms
[2020-06-03 07:01:00] [INFO ] Deduced a trap composed of 52 places in 158 ms
[2020-06-03 07:01:00] [INFO ] Deduced a trap composed of 59 places in 157 ms
[2020-06-03 07:01:00] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2020-06-03 07:01:00] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 60 places in 143 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 58 places in 148 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 47 places in 133 ms
[2020-06-03 07:01:01] [INFO ] Deduced a trap composed of 56 places in 131 ms
[2020-06-03 07:01:02] [INFO ] Deduced a trap composed of 60 places in 118 ms
[2020-06-03 07:01:02] [INFO ] Deduced a trap composed of 17 places in 136 ms
[2020-06-03 07:01:02] [INFO ] Deduced a trap composed of 32 places in 132 ms
[2020-06-03 07:01:02] [INFO ] Deduced a trap composed of 36 places in 243 ms
[2020-06-03 07:01:02] [INFO ] Deduced a trap composed of 8 places in 281 ms
[2020-06-03 07:01:07] [INFO ] Deduced a trap composed of 17 places in 4403 ms
[2020-06-03 07:01:12] [INFO ] Deduced a trap composed of 24 places in 5250 ms
[2020-06-03 07:01:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s282 s283 s290 s293 s492 s493 s494 s498 s503 s508 s517 s518 s519 s523 s659 s660 s661 s662 s665 s674 s675) 0)") while checking expression at index 0
[2020-06-03 07:01:12] [INFO ] [Real]Absence check using 78 positive place invariants in 84 ms returned sat
[2020-06-03 07:01:12] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 23 ms returned sat
[2020-06-03 07:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:13] [INFO ] [Real]Absence check using state equation in 696 ms returned unsat
[2020-06-03 07:01:14] [INFO ] [Real]Absence check using 78 positive place invariants in 563 ms returned sat
[2020-06-03 07:01:14] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 64 ms returned sat
[2020-06-03 07:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:15] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2020-06-03 07:01:15] [INFO ] Deduced a trap composed of 8 places in 427 ms
[2020-06-03 07:01:16] [INFO ] Deduced a trap composed of 18 places in 291 ms
[2020-06-03 07:01:16] [INFO ] Deduced a trap composed of 16 places in 273 ms
[2020-06-03 07:01:16] [INFO ] Deduced a trap composed of 11 places in 443 ms
[2020-06-03 07:01:17] [INFO ] Deduced a trap composed of 16 places in 437 ms
[2020-06-03 07:01:17] [INFO ] Deduced a trap composed of 132 places in 270 ms
[2020-06-03 07:01:18] [INFO ] Deduced a trap composed of 25 places in 296 ms
[2020-06-03 07:01:18] [INFO ] Deduced a trap composed of 143 places in 443 ms
[2020-06-03 07:01:19] [INFO ] Deduced a trap composed of 134 places in 827 ms
[2020-06-03 07:01:21] [INFO ] Deduced a trap composed of 23 places in 2203 ms
[2020-06-03 07:01:22] [INFO ] Deduced a trap composed of 38 places in 570 ms
[2020-06-03 07:01:23] [INFO ] Deduced a trap composed of 31 places in 930 ms
[2020-06-03 07:01:30] [INFO ] Deduced a trap composed of 131 places in 7187 ms
[2020-06-03 07:01:37] [INFO ] Deduced a trap composed of 25 places in 7096 ms
[2020-06-03 07:01:37] [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 s203 s467 s468 s469 s625 s626) 0)") while checking expression at index 2
[2020-06-03 07:01:38] [INFO ] [Real]Absence check using 78 positive place invariants in 347 ms returned sat
[2020-06-03 07:01:38] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 137 ms returned sat
[2020-06-03 07:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:40] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 12 places in 326 ms
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 20 places in 336 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 19 places in 315 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 22 places in 122 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 36 places in 112 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 34 places in 101 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 32 places in 105 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 35 places in 113 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 40 places in 106 ms
[2020-06-03 07:01:43] [INFO ] Deduced a trap composed of 37 places in 933 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 21 places in 3939 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 37 places in 78 ms
[2020-06-03 07:01:48] [INFO ] Deduced a trap composed of 38 places in 1011 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 39 places in 222 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 65 places in 448 ms
[2020-06-03 07:01:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 9493 ms
[2020-06-03 07:01:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:01:50] [INFO ] [Nat]Absence check using 78 positive place invariants in 239 ms returned sat
[2020-06-03 07:01:50] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 57 ms returned sat
[2020-06-03 07:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:51] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2020-06-03 07:01:51] [INFO ] Deduced a trap composed of 19 places in 486 ms
[2020-06-03 07:01:56] [INFO ] Deduced a trap composed of 156 places in 4931 ms
[2020-06-03 07:02:05] [INFO ] Deduced a trap composed of 21 places in 8311 ms
[2020-06-03 07:02:05] [INFO ] Deduced a trap composed of 136 places in 263 ms
[2020-06-03 07:02:06] [INFO ] Deduced a trap composed of 17 places in 435 ms
[2020-06-03 07:02:06] [INFO ] Deduced a trap composed of 163 places in 240 ms
[2020-06-03 07:02:06] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2020-06-03 07:02:06] [INFO ] Deduced a trap composed of 16 places in 226 ms
[2020-06-03 07:02:07] [INFO ] Deduced a trap composed of 25 places in 232 ms
[2020-06-03 07:02:07] [INFO ] Deduced a trap composed of 22 places in 232 ms
[2020-06-03 07:02:07] [INFO ] Deduced a trap composed of 127 places in 240 ms
[2020-06-03 07:02:07] [INFO ] Deduced a trap composed of 162 places in 229 ms
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 163 places in 211 ms
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 29 places in 206 ms
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 36 places in 266 ms
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 42 places in 216 ms
[2020-06-03 07:02:09] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2020-06-03 07:02:09] [INFO ] Deduced a trap composed of 42 places in 214 ms
[2020-06-03 07:02:09] [INFO ] Deduced a trap composed of 25 places in 219 ms
[2020-06-03 07:02:09] [INFO ] Deduced a trap composed of 169 places in 229 ms
[2020-06-03 07:02:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s73 s75 s77 s83 s87 s88 s102 s108 s114 s117 s120 s121 s133 s134 s135 s146 s147 s148 s155 s160 s161 s171 s172 s173 s195 s196 s206 s207 s208 s231 s232 s233 s259 s260 s263 s264 s274 s275 s276 s277 s335 s337 s350 s352 s355 s356 s357 s370 s371 s372 s381 s390 s392 s396 s401 s427 s429 s433 s448 s453 s458 s462 s464 s468 s473 s478 s488 s493 s498 s518 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s546 s547 s550 s551 s552 s553 s554 s556 s558 s562 s563 s564 s566 s567 s568 s575 s576 s593 s594 s599 s600 s601 s602 s606 s607 s610 s611 s619 s620 s621 s622 s629 s630 s633 s634 s635 s636 s639 s640 s641 s642 s647 s648 s655 s656 s659 s660 s668 s669 s670 s671 s672 s673 s678 s679 s680 s681 s682 s683 s684 s685 s686 s690 s691 s693 s694 s699 s700 s705 s706 s708 s709 s711 s712 s716) 0)") while checking expression at index 3
[2020-06-03 07:02:10] [INFO ] [Real]Absence check using 78 positive place invariants in 50 ms returned sat
[2020-06-03 07:02:10] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 26 ms returned sat
[2020-06-03 07:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:11] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2020-06-03 07:02:11] [INFO ] Deduced a trap composed of 11 places in 350 ms
[2020-06-03 07:02:11] [INFO ] Deduced a trap composed of 8 places in 277 ms
[2020-06-03 07:02:12] [INFO ] Deduced a trap composed of 21 places in 295 ms
[2020-06-03 07:02:12] [INFO ] Deduced a trap composed of 18 places in 262 ms
[2020-06-03 07:02:12] [INFO ] Deduced a trap composed of 29 places in 292 ms
[2020-06-03 07:02:13] [INFO ] Deduced a trap composed of 22 places in 461 ms
[2020-06-03 07:02:13] [INFO ] Deduced a trap composed of 21 places in 414 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 39 places in 486 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 18 places in 216 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-06-03 07:02:20] [INFO ] Deduced a trap composed of 28 places in 5552 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 148 places in 3836 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 31 places in 233 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 45 places in 209 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 30 places in 110 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 31 places in 478 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 34 places in 214 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 33 places in 223 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 37 places in 162 ms
[2020-06-03 07:02:26] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 15564 ms
[2020-06-03 07:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:02:26] [INFO ] [Nat]Absence check using 78 positive place invariants in 141 ms returned sat
[2020-06-03 07:02:27] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 49 ms returned sat
[2020-06-03 07:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:31] [INFO ] [Nat]Absence check using state equation in 4656 ms returned sat
[2020-06-03 07:02:33] [INFO ] Deduced a trap composed of 11 places in 1852 ms
[2020-06-03 07:02:33] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-03 07:02:34] [INFO ] Deduced a trap composed of 21 places in 500 ms
[2020-06-03 07:02:34] [INFO ] Deduced a trap composed of 18 places in 239 ms
[2020-06-03 07:02:34] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-03 07:02:35] [INFO ] Deduced a trap composed of 22 places in 1009 ms
[2020-06-03 07:02:36] [INFO ] Deduced a trap composed of 21 places in 593 ms
[2020-06-03 07:02:36] [INFO ] Deduced a trap composed of 39 places in 238 ms
[2020-06-03 07:02:37] [INFO ] Deduced a trap composed of 150 places in 767 ms
[2020-06-03 07:02:37] [INFO ] Deduced a trap composed of 23 places in 329 ms
[2020-06-03 07:02:38] [INFO ] Deduced a trap composed of 157 places in 223 ms
[2020-06-03 07:02:38] [INFO ] Deduced a trap composed of 157 places in 224 ms
[2020-06-03 07:02:38] [INFO ] Deduced a trap composed of 18 places in 241 ms
[2020-06-03 07:02:38] [INFO ] Deduced a trap composed of 31 places in 217 ms
[2020-06-03 07:02:39] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2020-06-03 07:02:39] [INFO ] Deduced a trap composed of 32 places in 129 ms
[2020-06-03 07:02:39] [INFO ] Deduced a trap composed of 37 places in 116 ms
[2020-06-03 07:02:39] [INFO ] Deduced a trap composed of 39 places in 496 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 44 places in 103 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 31 places in 104 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 30 places in 98 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 34 places in 94 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 45 places in 113 ms
[2020-06-03 07:02:40] [INFO ] Deduced a trap composed of 49 places in 80 ms
[2020-06-03 07:02:40] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 9182 ms
[2020-06-03 07:02:40] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 31 ms.
[2020-06-03 07:02:46] [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 (=> (> t631 0) (and (and (> t484 0) (< o484 o631)) (and (> t566 0) (< o566 o631)) (or (and (> t12 0) (< o12 o631)) (and (> t14 0) (< o14 o631)) (and (> t17 0) (< o17 o631)) (and (> t19 0) (< o19 o631)) (and (> t22 0) (< o22 o631)) (and (> t25 0) (< o25 o631)) (and (> t29 0) (< o29 o631)) (and (> t34 0) (< o34 o631)) (and (> t37 0) (< o37 o631)) (and (> t40 0) (< o40 o631)) (and (> t43 0) (< o43 o631)) (and (> t46 0) (< o46 o631)) (and (> t49 0) (< o49 o631)) (and (> t52 0) (< o52 o631)) (and (> t54 0) (< o54 o631)) (and (> t57 0) (< o57 o631)) (and (> t60 0) (< o60 o631)) (and (> t63 0) (< o63 o631)) (and (> t67 0) (< o67 o631)) (and (> t72 0) (< o72 o631)) (and (> t77 0) (< o77 o631)) (and (> t80 0) (< o80 o631)) (and (> t83 0) (< o83 o631)) (and (> t85 0) (< o85 o631)) (and (> t87 0) (< o87 o631)) (and (> t90 0) (< o90 o631)) (and (> t93 0) (< o93 o631)) (and (> t96 0) (< o96 o631)) (and (> t99 0) (< o99 o631)) (and (> t102 0) (< o102 o631)) (and (> t104 0) (< o104 o631)) (and (> t107 0) (< o107 o631)) (and (> t109 0) (< o109 o631)) (and (> t111 0) (< o111 o631)) (and (> t115 0) (< o115 o631)) (and (> t119 0) (< o119 o631)) (and (> t123 0) (< o123 o631)) (and (> t129 0) (< o129 o631)) (and (> t131 0) (< o131 o631)) (and (> t133 0) (< o133 o631)) (and (> t135 0) (< o135 o631)) (and (> t137 0) (< o137 o631)) (and (> t139 0) (< o139 o631)) (and (> t144 0) (< o144 o631)) (and (> t146 0) (< o146 o631)) (and (> t148 0) (< o148 o631)) (and (> t153 0) (< o153 o631)) (and (> t155 0) (< o155 o631)))))") while checking expression at index 4
[2020-06-03 07:02:46] [INFO ] [Real]Absence check using 78 positive place invariants in 63 ms returned sat
[2020-06-03 07:02:46] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2020-06-03 07:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:48] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2020-06-03 07:02:48] [INFO ] Deduced a trap composed of 8 places in 605 ms
[2020-06-03 07:02:49] [INFO ] Deduced a trap composed of 23 places in 489 ms
[2020-06-03 07:02:49] [INFO ] Deduced a trap composed of 16 places in 514 ms
[2020-06-03 07:02:50] [INFO ] Deduced a trap composed of 11 places in 507 ms
[2020-06-03 07:02:50] [INFO ] Deduced a trap composed of 13 places in 498 ms
[2020-06-03 07:02:52] [INFO ] Deduced a trap composed of 21 places in 1815 ms
[2020-06-03 07:02:53] [INFO ] Deduced a trap composed of 11 places in 501 ms
[2020-06-03 07:02:53] [INFO ] Deduced a trap composed of 150 places in 535 ms
[2020-06-03 07:02:54] [INFO ] Deduced a trap composed of 18 places in 479 ms
[2020-06-03 07:02:55] [INFO ] Deduced a trap composed of 22 places in 1262 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 152 places in 486 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 152 places in 312 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 154 places in 259 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 28 places in 235 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 52 places in 240 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 32 places in 240 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 29 places in 250 ms
[2020-06-03 07:02:58] [INFO ] Deduced a trap composed of 65 places in 240 ms
[2020-06-03 07:02:58] [INFO ] Deduced a trap composed of 150 places in 268 ms
[2020-06-03 07:02:58] [INFO ] Deduced a trap composed of 51 places in 273 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 157 places in 242 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 150 places in 273 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 52 places in 335 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 39 places in 524 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 16 places in 460 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 27 places in 476 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 145 places in 477 ms
[2020-06-03 07:03:02] [INFO ] Deduced a trap composed of 27 places in 464 ms
[2020-06-03 07:03:02] [INFO ] Deduced a trap composed of 62 places in 452 ms
[2020-06-03 07:03:04] [INFO ] Deduced a trap composed of 49 places in 1406 ms
[2020-06-03 07:03:06] [INFO ] Deduced a trap composed of 146 places in 2592 ms
[2020-06-03 07:03:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s69 s71 s73 s75 s77 s80 s81 s82 s83 s86 s87 s88 s96 s99 s108 s114 s122 s123 s133 s134 s135 s155 s157 s158 s165 s166 s167 s191 s192 s195 s200 s201 s202 s220 s221 s225 s226 s227 s237 s238 s239 s243 s244 s245 s259 s260 s263 s264 s282 s283 s286 s340 s350 s351 s352 s355 s356 s357 s371 s376 s380 s381 s382 s391 s396 s401 s427 s429 s437 s438 s439 s442 s444 s452 s454 s458 s463 s468 s478 s483 s488 s498 s503 s517 s518 s519 s527 s528 s529 s530 s531 s532 s533 s536 s537 s538 s539 s540 s541 s542 s543 s546 s547 s548 s549 s550 s551 s573 s574 s587 s588 s597 s598 s605 s608 s609 s610 s611 s616 s617 s618 s625 s626 s627 s628 s629 s630 s655 s656 s659 s660 s663 s664 s672 s673 s674 s675 s678 s679 s684 s714 s715) 0)") while checking expression at index 5
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 07:03:07] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 07:03:07] [INFO ] Flatten gal took : 166 ms
FORMULA BusinessProcesses-PT-20-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:03:07] [INFO ] Applying decomposition
[2020-06-03 07:03:07] [INFO ] Flatten gal took : 60 ms
[2020-06-03 07:03:07] [INFO ] Decomposing Gal with order
[2020-06-03 07:03:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 07:03:07] [INFO ] Removed a total of 118 redundant transitions.
[2020-06-03 07:03:07] [INFO ] Flatten gal took : 197 ms
[2020-06-03 07:03:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 474 ms.
[2020-06-03 07:03:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-03 07:03:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-20 @ 3570 seconds

FORMULA BusinessProcesses-PT-20-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-20-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 802104 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16136816 kB

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100602"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;